Добірка наукової літератури з теми "Distribution network design Problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Distribution network design Problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Distribution network design Problem":
1
Ben-Ayed, Omar. "Parcel distribution network design problem." Operational Research 13, no. 2 (August 3, 2011): 211–32. http://dx.doi.org/10.1007/s12351-011-0118-2.
2
Sangroula, Uchit, Kuk-Heon Han, Kang-Min Koo, Kapil Gnawali, and Kyung-Taek Yum. "Optimization of Water Distribution Networks Using Genetic Algorithm Based SOP–WDN Program." Water 14, no. 6 (March 9, 2022): 851. http://dx.doi.org/10.3390/w14060851.
Анотація:
Water distribution networks are vital hydraulic infrastructures, essential for providing consumers with sufficient water of appropriate quality. The cost of construction, operation, and maintenance of such networks is extremely large. The problem of optimization of a water distribution network is governed by the type of water distribution network and the size of pipelines placed in the distribution network. This problem of optimal diameter allocation of pipes in a distribution network has been heavily researched over the past few decades. This study describes the development of an algorithm, ‘Smart Optimization Program for Water Distribution Networks’ (SOP–WDN), which applies genetic algorithm to the problem of the least-cost design of water distribution networks. SOP–WDN demonstrates the application of an evolutionary optimization technique, i.e., genetic algorithm, linked with a hydraulic simulation solver EPANET, for the optimal design of water distribution networks. The developed algorithm was applied to three benchmark water distribution network optimization problems and produced consistently good results. SOP–WDN can be utilized as a tool for guiding engineers during the design and rehabilitation of water distribution pipelines.
3
Ayed, Omar Ben. "Hierarchical parcel distribution facility ground network design problem." International Journal of Logistics Economics and Globalisation 2, no. 3 (2010): 250. http://dx.doi.org/10.1504/ijleg.2010.036303.
4
Melo Brentan, Bruno, Gustavo Meirelles Lima, Antonio Carlos Zuffo, and Edevar Luvizotto Junior. "Dimensionamento de redes de distribuição de água por meio de análise multicriterial." Revista DAE 221, no. 68 (2019): 118–30. http://dx.doi.org/10.36659/dae.2020.010.
Анотація:
O dimensionamento de redes de distribuição de água (RDAs) é feito para que as restrições operacionais de velo- cidade e pressão se mantenham dentro de limites que garantam a eficiência operacional. Assim, buscam-se as tubulações de menor custo para que essas condições sejam satisfeitas. Entretanto, ao adotar essa prática, ou- tras características da rede podem ser afetadas negativamente, como sua resiliência e capacidade de expansão. Dessa forma, este trabalho apresenta um estudo de caso em que a análise multicriterial é utilizada para realizar o dimensionamento de uma RDA. Primeiramente, um mapa cognitivo é feito para identificar os principais cri- térios a serem considerados na solução do problema. Em seguida, o método Delphi é usado em conjunto com o Analytic Hierarchy Process (AHP) para determinar os pesos relativos de cada critério. Por fim, três diferentes métodos de análise multicritérios são utilizados para a solução do problema: AHP, Electre e Promethee. Palavras-chave: Rede de distribuição. Otimização. Análise multicritério. Abstract The design of water distribution networks (WDNs) is made to match velocity and pressure constraints that guaran- tee operational efficiency. Thus, pipes with lower cost are selected to attend these conditions. However, this proce- dure can harm other characteristics of the network, as for example its resilience and expansion capacity. Therefore, this paper presents a case study in which the multicriterial analysis is used to design a WDN. First, a cognitive map is built to identify the main criteria to be considered during the design process. Then, the Delphi method is used jointly with the Analytic Hierarchy Process (AHP) to define the relative weights of each criteria. Finally, three different methods for multicriterial analysis are used to solve the problem: AHP, Electre and Promethee. Keywords: Water distribution network. Optimization. Multicriterial analysis.
5
Miranda, Pablo A., and Rodrigo A. Garrido. "Inventory service-level optimization within distribution network design problem." International Journal of Production Economics 122, no. 1 (November 2009): 276–85. http://dx.doi.org/10.1016/j.ijpe.2009.06.010.
6
McClymont, Kent, Ed Keedwell, Dragan Savić, and Mark Randall-Smith. "A general multi-objective hyper-heuristic for water distribution network design with discolouration risk." Journal of Hydroinformatics 15, no. 3 (October 25, 2012): 700–716. http://dx.doi.org/10.2166/hydro.2012.022.
Анотація:
The optimisation of water distribution networks (WDNs) by evolutionary algorithms has gained much coverage in the literature since it was first proposed in the early 1990s. Despite being well studied, the problem and objectives continue to evolve as demands on water companies change. Motivated by the increased focus on reducing the risk of discolouration, this study examines a three objective version of the WDN design problem which takes into account cost, head excess and discolouration risk. Using this formulation, this paper presents a method for producing optimised network designs aimed at reducing discolouration risk in the network design phase and thus reducing the associated long-term maintenance and operational burdens of the system. This paper discusses the use of a discolouration risk model and, using this model, the optimisation of network design, specifically pipe diameters, to produce a range of high quality self-cleaning networks. The network designs are optimised using the Markov-chain hyper-heuristic (MCHH), a new multi-objective online selective hyper-heuristic. The MCHH is incorporated in to the known NSGA-II and SPEA2 and supplied with a range of heuristics tailored for use on the WDN design problem. The results demonstrate an improvement in performance obtained over the original algorithms.
7
Wang, Yang, Jin Xin Cao, Ri Dong Wang, and Xia Xi Li. "Research on Uncertain Network Design Problem." Applied Mechanics and Materials 505-506 (January 2014): 613–18. http://dx.doi.org/10.4028/www.scientific.net/amm.505-506.613.
Анотація:
In this study, a kind of uncertain network design problem, network design problem under uncertain construction cost, is researched.The discrete network design problem under uncertain construction costs deals with the selection of links to be added to the existing network, so as to minimize the total travel costs in the network. It is assumed that the value of the demand between each pair of origin and destination is a constant and the construction costs of each potential link addition follow a certain stochastic distribution. In this paper, a bi-level and stochastic programming model for the discrete network design problem is proposed. The construction costs of potential links are assumed as random variables and mutually independent with each other in this model. The upper-level model is a chance constrain model with the objective function of minimizing the total travel costs in the network, and the lower-level model is a user equilibrium model. The stochastic model is then transformed into a deterministic one. A branch-and-bound solution algorithm is designed to solve the deterministic model in an efficient way. At last, a computational experiment is conducted to illustrate the effectiveness and efficiency of the approach proposed in this paper. The results show that the stochastic model is more flexible and practical compared with the deterministic one.
8
Marmolejo, J. A., R. Rodríguez, O. Cruz-Mejia, and J. Saucedo. "Design of a Distribution Network Using Primal-Dual Decomposition." Mathematical Problems in Engineering 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/7851625.
Анотація:
A method to solve the design of a distribution network for bottled drinks company is introduced. The distribution network proposed includes three stages: manufacturing centers, consolidation centers using cross-docking, and distribution centers. The problem is formulated using a mixed-integer programming model in the deterministic and single period contexts. Because the problem considers several elements in each stage, a direct solution is very complicated. For medium-to-large instances the problem falls into large scale. Based on that, a primal-dual decomposition known as cross decomposition is proposed in this paper. This approach allows exploring simultaneously the primal and dual subproblems of the original problem. A comparison of the direct solution with a mixed-integer lineal programming solver versus the cross decomposition is shown for several randomly generated instances. Results show the good performance of the method proposed.
9
Blesa, Joaquim, Fatiha Nejjari, and Ramon Sarrate. "Robust sensor placement for leak location: analysis and design." Journal of Hydroinformatics 18, no. 1 (January 21, 2015): 136–48. http://dx.doi.org/10.2166/hydro.2015.021.
Анотація:
In this paper, a nominal sensor placement methodology for leak location in water distribution networks is presented. To reduce the size and the complexity of the optimization problem a clustering technique is combined with the nominal sensor placement methodology. Some of the pressure sensor placement methods for leak detection and location in water distribution networks are based on the pressure sensitivity matrix analysis. This matrix depends on the network demands, which are nondeterministic, and the leak magnitudes, that are unknown. The robustness of the nominal sensor placement methodology is investigated against the fault sensitivity matrix uncertainty. Providing upon the dependency of the leak location procedure on the network operating point, the nominal sensor placement problem is then reformulated as a multi-objective optimization for which Pareto optimal solutions are generated. The robustness study as well as the resulting robust sensor placement methodology are illustrated by means of a small academic network as well as a district metered area in the Barcelona water distribution network.
10
Gan, Mi, Xinyuan Li, Fadong Zhang, and Zhenggang He. "Regional Logistics Network Design in Mitigating Truck Flow-Caused Congestion Problems." Journal of Advanced Transportation 2020 (April 29, 2020): 1–12. http://dx.doi.org/10.1155/2020/5197025.
Анотація:
Truck flow plays a vital role in urban traffic congestion and has a significant influence on cities. In this study, we develop a novel model for solving regional logistics network (RLN) design problems considering the traffic status of the background transportation network. The models determine not only the facility location, initial distribution planning, roadway construction, and expansion decisions but also offer an optimal solution to the logistics network service level and truck-type selections. We first analyze the relationship between the urban transportation network and the RLN design problem using real truck data and traffic flow status in a typical city. Then, we develop the uncover degree function (UDF), which reflects the service degree of the RLN and formulates based on an impedance function. Subsequently, the integrated logistics network design models are proposed. We model the RLN design problem as a minimal cost problem and design double-layer Lagrangian relaxation heuristics algorithms to solve the model problems. Through experiments with data from the six-node problem and Sioux-Falls network, the effectiveness of the models and algorithms is verified. This study contributes to the planning of regional logistics networks while mitigating traffic congestion caused by truck flow.
Дисертації з теми "Distribution network design Problem":
1
Kchaou, Mouna. "Modeling and solving a distribution network design problem with multiple operational constraints : Application to a case-study in the automotive industry." Phd thesis, Ecole Centrale Paris, 2013. http://tel.archives-ouvertes.fr/tel-00978486.
Анотація:
L'objet de notre projet de recherche est le développement d'un modèle de conception d'un réseau de distribution composé de trois niveaux : les usines, les centres de distribution (CD) et les clients. Nous supposons que le nombre et la localisation des usines ainsi que le nombre et la localisation des clients sont connus. Etant donné la demande des clients et une liste de CD potentiels, l'objectif est de déterminer la localisation des CD à ouvrir et d'y affecter les clients de manière à minimiser le coût total. En termes de modélisation, nous considérons divers aspects opérationnels qui sont inspirés d'une étude de cas dans l'industrie automobile. Ces aspect ont été pris en compte séparément dans la littérature mais jamais combinés dans un même modèle. Plus particulièrement, nous introduisons un " clustering " en prétraitement afin de modéliser les tournées de camions. Nous intégrons également des contraintes de volume minimum sur les axes de transport, des contraintes de volume minimum et de capacité maximale sur les centres de distribution, des contraintes de distance de couverture maximale et des contraintes d'uni-affectation. Par ailleurs, nous étudions une extension multi-périodes du problème en utilisant un " clustering " dynamique pour modéliser des tournées de camions multi-périodes. En termes de résolution, comme le problème étudié est NP-difficile au sens fort, nous proposons différentes méthodes heuristiques performantes basées sur la relaxation linéaire. A travers les tests effectués, nous montrons que ces méthodes fournissent des solutions proches de l'optimale en moins de temps de calcul que l'application directe d'un solveur linéaire. Nous analysons également la structure des réseaux de distribution obtenus et nous comparons les résultats issus de plusieurs versions du modèle afin de montrer la valeur ajoutée du " clustering " ainsi que de l'approche multi-périodes.
2
Rajagopalan, Sreekanth. "Design and Maintenance Planning Problems in Commodity Distribution and Chemical Site Networks." Research Showcase @ CMU, 2018. http://repository.cmu.edu/dissertations/1141.
Анотація:
In this dissertation, we consider two specific types of problems over networks. In the first problem, we explore systematic methods to address some of the challenges in largescale maintenance planning in integrated chemical sites. In the second problem, we investigate different optimization model formulations for the design of flow distribution networks where the flow is potential-driven and nonlinearly related to the potential loss. Maintenance turnaround in the processing industry is a complex asset renewal project that includes huge capital expenditures and downtime losses. The option of deferring or rescheduling a turnaround project typically provides immediate financial relief from capital expenditure. However, the risk of running into site-wide disruptions in the form of unplanned events, yield, and reliability losses is not straightforward to assess. We propose mathematical optimization models to evaluate the risk of loss from turnaround deferrals in integrated sites and provide alternatives to reliably operate the site in a medium-term horizon. In the first chapter, we introduce the turnaround planning problem and the challenges it poses in integrated sites. We also introduce the background for the network design problem. In the second chapter, we study the financial impact of rescheduling turnarounds and the associated risk under unplanned outages. We compare the risk profiles presented by different production planning strategies. We propose a stochastic programming model for production planning that optimally builds up inventory ahead of time to hedge against production losses during unplanned outages. In the third chapter, we extend the stochastic optimization to handle a large set of scenarios and propose a Lagrangean decomposition method that improves a myopic production plan. The fourth chapter proposes a mixed-integer linear programming model that prescribes turnaround schedules when the underlying assets undergo yield loses and selectivity degradation. Here, we also study the impact of deferrals over a long-term horizon. The penultimate chapter addresses the nonlinear network design problem.The closing chapter summarizes the work and provides a few future directions. In the spirit of advancing manufacturing paradigms, the thesis supports investment in modeling efforts that address enterprise-wide planning problems.
3
Subramanian, Shivaram. "Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks." Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/27224.
Анотація:
A variety of practical network optimization problems arising in the context of public supply and commercial transportation, emergency response and risk management, engineering design, and industrial planning are addressed in this study. The decisions to be made in these problems include the location of supply centers, the routing, allocation and scheduling of flow between supply and demand locations, and the design of links in the network. This study is concerned with the development of optimization models and the analysis of five such problems, and the subsequent design and testing of exact and heuristic algorithms for solving these various network optimization problems.
The first problem addressed is the time-dependent shortest pair of disjoint paths problem. We examine computational complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. It is shown that this problem, and many variations of it, are nP-Hard and a 0-1 linear programming model that can be used to solve this problem is developed. This model can accommodate various degrees of disjointedness of the pair of paths, from complete to partial with respect to specific arcs.
Next, we examine a minimum-risk routing problem and pursue the development, analysis, and testing of a mathematical model for determining a route that attempts to reduce the risk of low probability-high consequence accidents related with the transportation of hazardous materials (hazmat). More specifically, the problem addressed in this study involves finding a path that minimizes the conditional expectation of a consequence, given that an accident occurs, subject to the expected value of the consequence being lesser than or equal to a specified level n, and the probability of an accident on the path being also constrained to be no more than some value h. Various insights into related modeling issues are also provided. The values n and h are user-prescribed and could be prompted by the solution of shortest path problems that minimize the respective corresponding linear risk functions. The proposed model is a discrete, fractional programming problem that is solved using a specialized branch-and-bound approach. The model is also tested using realistic data associated with a case concerned with routing hazmat through the roadways of Bethlehem, Pennsylvania.
The third problem deals with the development of a resource allocation strategy for emergency and risk management. An important and novel issue addressed in modeling this problem is the effect of loss in coverage due to the non-availability of emergency response vehicles that are currently serving certain primary incidents. This is accommodated within the model by including in the objective function a term that reflects the opportunity cost for serving an additional incident that might occur probabilistically on the network. A mixed-integer programming model is formulated for the multiple incident - multiple response problem, and we show how its solution capability can be significantly enhanced by injecting a particular structure into the constraints that results in an equivalent alternative model representation. Furthermore, for certain special cases of the MIMR problem, efficient polynomial-time solution approaches are prescribed. An algorithmic module composed of these procedures, and used in concert with a computationally efficient LP-based heuristic scheme that is developed, has been incorporated into an area-wide incident management decision support system (WAIMSS) at the Center for Transportation Research, Virginia Tech.
The fourth problem addressed in this study deals with the development of global optimization algorithms for designing a water distribution network, or expanding an already existing one, that satisfies specified flow demands at stated pressure head requirements. The nonlinear, nonconvex network problem is transformed into the space of certain design variables. By relaxing the nonlinear constraints in the transformed space via suitable polyhedral outer approximations and applying the Reformulation-Linearization Technique (RLT), a tight linear lower bounding problem is derived. This problem provides an enhancement and a more precise representation of previous lower bounding relaxations that use similar approximations. Computational experience on three standard test problems from the literature is provided. For all these problems, a proven global optimal solution within a tolerance of 10 -4 % and/or within 1$ of optimality is obtained. For the two larger instances dealing with the Hanoi and New York test networks that have been open for nearly three decades, the solutions derived represent significant improvements, and the global optimality has been verified at the stated level of accuracy for these problems for the very first time in the literature. A new real network design test problem based on the Town of Blacksburg Water Distribution System is also offered to be included in the available library of test cases, and related computational results on deriving global optimal solutions are presented.
The final problem addressed in this study is concerned with a global optimization approach for solving capacitated Euclidean distance multifacility location-allocation problems, as well as the development of a new algorithm for solving the generalized lp distance location-allocation problem. There exists no global optimization algorithm that has been developed and tested for this class of problems, aside from a total enumeration approach. Beginning with the Euclidean distance problem, we design depth-first and best-first branch-and-bound algorithms based on a partitioning of the allocation space that finitely converges to a global optimum for this nonconvex problem. For deriving lower bounds at node subproblems in these partial enumeration schemes, we employ two types of procedures. The first approach computes a lower bound via a simple projected location space lower bounding (PLSB) subproblem. The second approach derives a significantly enhanced lower bound by using a Reformulation-Linearization Technique (RLT) to transform an equivalent representation of the original nonconvex problem into a higher dimensional linear programming relaxation. In addition, certain cut-set inequalities generated in the allocation space, objective function based cuts derived in the location space, and tangential linear supporting hyperplanes for the distance function are added to further tighten the lower bounding relaxation. The RLT procedure is then extended to the.general lp distance problem for 1 < p < 2. Various issues related to the selection of branching variables, the design of heuristics via special selective backtracking mechanisms, and the study of the sensitivity of the proposed algorithm to the value of p in the lp - norm, are computationally investigated. Computational experience is also provided on a set of test problems to investigate both the PLSB and the RLT-lower bounding schemes. The results indicate that the proposed global optimization approach using the RLT-based scheme offers a promising viable solution procedure. In fact, among the problems solved, for the only two test instances previously available in the literature for the Euclidean distance case that were posed in 1979, we report proven global optimal solutions within a tolerance of 0.1% for the first time.
It is hoped that the modeling, analysis, insights, and concepts provided for these various network based problems that arise in diverse routing, location, distribution, and design contexts, will provide guidelines for studying many other problems that arise in related situations.Ph. D.
4
Kchaou-Boujelben, Mouna. "Modeling and solving a distribution network design problem with multiple operational constraints. Application to a case-study in the automotive industry." Phd thesis, Ecole Centrale Paris, 2013. http://tel.archives-ouvertes.fr/tel-00946890.
Анотація:
A cause de leur aspect strat égique et des divers challenges qu'ils repr ésentent en termes de mod élisation et de r ésolution, les probl èmes de localisation et de conception de r éseaux ont été largement étudi es par les sp écialistes en recherche opérationnelle. Par ailleurs, bien que les études de cas dans ce domaine soient rares dans la litt érature, plusieurs travaux r écents ont int égr é certains aspects op érationnels afi n de rendre ces probl èmes d'optimisation plus r éalistes. L'objet de notre projet de recherche est le d éveloppement d'un mod èle de conception d'un r éseau de distribution prenant en compte plusieurs aspects op érationnels inspir és d'une étude de cas dans le domaine de l'automobile. Bien que nos choix de mod élisation soient motiv és par cette étude de cas, ils restent applicables dans d'autres secteurs industriels. Le r éseau de distribution consid ér é se compose de trois niveaux : les usines au premier niveau, les centres de distribution (CD) au deuxi ème niveau et les clients au dernier niveau. Nous supposons que le nombre et la localisation des usines ainsi que le nombre et la localisation des clients sont connus. Etant donn é la demande des clients et une liste de CD potentiels, l'objectif est de d éterminer la localisation des CD a ouvrir et d'y a ffecter les clients de mani ère a minimiser le coût total. Nos contributions par rapport aux travaux existants concernent la mod élisation et la r ésolution du probl ème ainsi que les tests num ériques eff ectu és. En termes de mod élisation, nous consid érons divers aspects op érationnels qui ont été pris en compte s épar ément dans la litt érature mais jamais combin és dans un même mod èle. Plus particuli èrement, nous introduisons un "clustering" en pr étraitement afi n de mod éliser les tourn ées de camions. Nous int égrons également des contraintes de volume minimum sur les axes de transport pour assurer l'utilisation de camions pleins, des contraintes de volume minimum et de capacit é maximale sur les centres de distribution, des contraintes de distance de couverture maximale et des contraintes d'uni-aff ectation. Par ailleurs, nous étudions une extension multi-p ériodes du probl ème en utilisant un "clustering" dynamique pour mod éliser des tourn ées de camions multi-p ériodes. En termes de r ésolution, comme le probl ème étudi é est NP-di ffcile au sens fort, nous proposons di fférentes m éthodes heuristiques performantes bas ées sur la relaxation lin éaire. A travers les tests eff ectu és, nous montrons que ces m éthodes fournissent des solutions proches de l'optimale en moins de temps de calcul que l'application directe d'un solveur lin éaire. Nous analysons également la structure des r éseaux de distribution obtenus et nous comparons les r ésultats issus de plusieurs versions du mod èle afi n de montrer la valeur ajout ée du "clustering" ainsi que de l'approche multi-p ériodes.
5
Ben, Mohamed Imen. "Designing Two-Echelon Distribution Networks under Uncertainty." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0073.
Анотація:
Avec la forte croissance du e-commerce et l'augmentation continue de la population des villes impliquant des niveaux de congestion plus élevés, les réseaux de distribution doivent déployer des échelons supplémentaires pour offrir un ajustement dynamique aux besoins des entreprises au cours du temps et faire face aux aléas affectant l’activité de distribution. Dans ce contexte, les praticiens s'intéressent aux réseaux de distribution à deux échelons. Dans cette thèse, nous commençons par présenter une revue complète des problèmes de design des réseaux de distribution et souligner des caractéristiques essentielles de modélisation. Ces aspects impliquent la structure à deux échelons, l’aspect multi-période, l’incertitude et les méthodes de résolution. Notre objectif est donc, d’élaborer un cadre complet pour le design d’un réseau de distribution efficace à deux échelons, sous incertitude et multi-périodicité, dans lequel les produits sont acheminés depuis les plateformes de stockage (WP) vers les plateformes de distribution (DP) avant d'être transportés vers les clients. Ce cadre est caractérisé par une hiérarchie temporelle entre le niveau de design impliquant des décisions relatives à la localisation des plateformes et à la capacité allouée aux DPs sur une échelle de temps annuelle, et le niveau opérationnel concernant des décisions journalières de transport. % sur une base journalière.Dans une première étude, nous introduisons le cadre complet pour le problème de design de réseaux de distribution à deux échelons avec une demande incertaine, une demande et un coût variables dans le temps. Le problème est formulé comme un programme stochastique à plusieurs étapes. Il implique au niveau stratégique des décisions de localisation des DPs ainsi que des décisions d'affectation des capacités aux DPs sur plusieurs périodes de design, et au niveau opérationnel des décisions de transport sous forme d'arcs origine-destination. Ensuite, nous proposons deux modèles alternatifs basés sur la programmation stochastique à deux étapes avec recours, et les résolvons par une approche de décomposition de Benders intégrée à une technique d’approximation moyenne d’échantillon (SAA). Par la suite, nous nous intéressons à la livraison du dernier kilomètre dans un contexte urbain où les décisions de transport dans le deuxième échelon sont caractérisées par des tournées de véhicules. Un problème multi-période stochastique de localisation-routage à deux échelons avec capacité (2E-SM-CLRP) est défini, dans lequel les décisions de localisation concernent les WPs et les DPs. Le modèle est un programme stochastique à deux étapes avec recours en nombre entier. Nous développons un algorithme de décomposition de Benders. Les décisions de localisation et de capacité sont déterminées par la solution du problème maître de Benders. Le sous-problème résultant est un problème multi-dépôt de tournées de véhicule avec des dépôts et véhicules capacitaires qui est résolu par un algorithme de branch-cut-and-price.Enfin, nous étudions le cadre à plusieurs étapes proposé pour le problème stochastique multi-période de design de réseaux de distribution à deux échelons et évaluons sa tractabilité. Pour ceci, nous développons une heuristique à horizon glissant qui permet d’obtenir des bornes de bonne qualité et des solutions de design pour le modèle à plusieurs étapesWith the high growth of e-commerce and the continuous increase in cities population contrasted with the rising levels of congestion, distribution schemes need to deploy additional echelons to offer more dynamic adjustment to the requirement of the business over time and to cope with all the random factors. In this context, a two-echelon distribution network is nowadays investigated by the practitioners.In this thesis, we first present a global survey on distribution network design problems and point out many critical modeling features, namely the two-echelon structure, the multi-period setting, the uncertainty and solution approaches. The aim, here, is to propose a comprehensive framework for the design of an efficient two-echelon distribution network under multi-period and stochastic settings in which products are directed from warehouse platforms (WPs) to distribution platforms (DPs) before being transported to customers. A temporal hierarchy characterizes the design level dealing with facility-location and capacity decisions over a set of design periods, while the operational level involves transportation decisions on a daily basis.Then, we introduce the comprehensive framework for the two-echelon distribution network design problem under uncertain demand, and time-varying demand and cost, formulated as a multi-stage stochastic program. This work looks at a generic case for the deployment of a retailer's distribution network. Thus, the problem involves, at the strategic level, decisions on the number and location of DPs along the set of design periods as well as decisions on the capacity assignment to calibrate DP throughput capacity. The operational decisions related to transportation are modeled as origin-destination arcs. Subsequently, we propose alternative modeling approaches based on two-stage stochastic programming with recourse, and solve the resulting models using a Benders decomposition approach integrated with a sample average approximation (SAA) technique.Next, we are interested in the last-mile delivery in an urban context where transportation decisions involved in the second echelon are addressed through multi-drop routes. A two-echelon stochastic multi-period capacitated location-routing problem (2E-SM-CLRP) is defined in which facility-location decisions concern both WPs and DPs. We model the problem using a two-stage stochastic program with integer recourse. To solve the 2E-SM-CLRP, we develop a Benders decomposition algorithm. The location and capacity decisions are fixed from the solution of the Benders master problem. The resulting subproblem is a capacitated vehicle-routing problem with capacitated multi-depot (CVRP-CMD) and is solved using a branch-cut-and-price algorithm.Finally, we focus on the multi-stage framework proposed for the stochastic multi-period two-echelon distribution network design problem and evaluate its tractability. A scenario tree is built to handle the set of scenarios representing demand uncertainty. We present a compact formulation and develop a rolling horizon heuristic to produce design solutions for the multi-stage model. It provides good quality bounds in a reasonable computational times
6
Mrabti, Nassim. "Contribution à l'optimisation de la distribution collaborative avec partage de gains sous critères de durabilité." Electronic Thesis or Diss., Amiens, 2021. http://www.theses.fr/2021AMIE0072.
Анотація:
Les préoccupations liées au développement durable influencent de plus en plus le comportement des clients ainsi que les stratégies des entreprises. Ainsi, l'optimisation des réseaux de distribution par la collaboration horizontale devient une nécessité. Après une analyse exhaustive de la littérature, nous avons constaté que la plupart des travaux proposant des approches quantitatives abordent le niveau de décision opérationnelle par le biais de l'optimisation de la planification du transport. Par conséquent, nous traitons dans cette thèse les deux niveaux de décision : stratégique et tactique. Le premier niveau est étudié à travers le problème de conception des réseaux de distribution collaboratifs, tandis que le deuxième niveau s'intéresse au problème de répartition des coûts et des émissions de CO2. En outre, nous pensons que réduire tous les aspects de la durabilité en un seul objectif n'est pas recommandé. Dans ce contexte, nous abordons les deux problèmes en tenant compte de la durabilité économique, environnementale et sociale. Nous proposons des modèles mathématiques pour concevoir des réseaux de distribution à deux et à trois échelons. Par ailleurs, l'implication des indicateurs de durabilité lors du partage des bénéfices permet de récompenser les partenaires qui participent au mieux à la durabilité. Dans ce contexte, nous avons développé deux approches qui utilisent les niveaux de durabilité et de flexibilité de chaque partenaire dans le but de répartir d'une manière équitable les bénéfices de la collaboration. D'autre part, plusieurs scénarios sont comparés sur la base des indicateurs proposés. Au niveau de la résolution des modèles mathématiques, l'optimisation mono-objectif est effectuée d'une façon exacte et en utilisant l'algorithme génétique et le recuit simulé, tandis que l'optimisation multi-objectif est réalisée par la méthode ε-contrainte et le NSGA-II. Les résultats et les analyses obtenus montrent que la collaboration offre toujours une meilleure performance par rapport à la non-collaboration sur tous les niveaux de durabilité. Plusieurs décisions managériales sont présentées pour appliquer correctement la collaboration horizontale et améliorer davantage sa performance en termes de durabilitéSustainability issues are increasingly influencing customer behavior and corporate strategy. Consequently, the optimization of distribution networks through horizontal collaboration is becoming a necessity. After a comprehensive review of the literature, we found that most studies proposing quantitative approaches address the operational decision level through the optimization of transport planning. Therefore, in this thesis we deal with both strategic and tactical decision levels. The first level is studied by the collaborative distribution network design problem, while the second level is studied by the cost and CO2 emission allocation problem. Furthermore, we believe that reducing all sustainability dimensions to a single objective is not desirable. In this context, we address both problems by taking into account economic, environmental and social sustainability. We have developed mathematical models to design two- and three-echelon distribution networks. In addition, the inclusion of sustainability indicators in the profit-sharing process makes it possible to reward partners who best contribute to sustainability. In this context, we have developed two approaches that use the levels of sustainability and flexibility of each partner in order to distribute the benefits of the collaboration in a fair way. Furthermore, several scenarios are compared on the basis of the proposed indicators. Regarding the resolution of the mathematical models, the single-objective optimization is carried out in an exact way and by using the genetic algorithm and the simulated annealing, while the multi-objective optimization is carried out by the ε-constraint method and the NSGA-II. The results and analyses obtained show that collaboration always provides better performance compared to non-collaboration on all sustainability levels. Several managerial decisions are presented to properly apply horizontal collaboration and further improve its sustainability performance
7
Balakrishnan, Anantaram, Thomas L. Magnanti, and Prakash Mirchandani. "The Multi-Network Design Problem." Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5200.
Анотація:
This paper studies a new multi-facility network synthesis problem, called the Multi-level Network Design (MLND) problem, that arises in the topological design of hierarchical communication, transportation, and electric power distribution networks whose nodes have varying levels of importance:the more critical or higher level nodes require higher grade interconnections. Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the MLND problem seeks a connected design that minimizes total fixed cost while spanning all the nodes, and connecting nodes at each level via facilities of the corresponding or higher type. This problem generalizes the well-known Steiner network problem and the hierarchical network design problem. In this paper, we describe alternative model formulations for this problem and analyze the worst-case performance for heuristics based upon Steiner and spanning tree computations. For one model that we consider, the heuristic worst-case bounds on the performance ratio are either 4/3 or the worst-case performance ratio p of the embedded Steiner tree heuristic. A companion paper develops and tests a dual ascent procedure that generates tight upper and lower bounds on the optimal value of the problem. Keywords: Network design, integer programming, valid inequalities, worstcase analysis of heuristics.
8
Melovic, Dejan. "Optimal distribution network design policy." Thesis, University of Manchester, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.557289.
9
Akkas, Izzet Saygin. "Reliability Based Water Distribution Network Design." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607830/index.pdf.
Анотація:
The need of water and the limited sources, force the researchers to find the most economical and feasible solution in the design of a water distribution network. In this study, reliability and optimization of a water distribution network are taken into account together in the design stage of the network. The relationship between reliability of a water distribution network and its cost is examined during the design of a water distribution network. A methodology for deciding the reliability level of the selected design is proposed by examining the reliability-cost relationship. The design alternatives for the case study area are obtained by the aid of a commercially available software WADISO employing partial enumeration optimization technique. The reliability value for each of the design alternative is calculated according to Misirdali (2003)&rsquos adaptation based on the methodology proposed by Bao and Mays (1990) by the aid of a hydraulic network solver program HapMam prepared by Nohutç
u (2002). For purposes of illustration, the skeletonized form of Ankara Water Distribution Network subpressure zone (N8-1) is taken as the case study area. The methodology in this study, covering the relation between the reliability and the cost of a water distribution network and the proposed reliability level can be used in the design of new systems.
10
Keles, Gultekin. "Water Distribution Network Design By Partial Enumeration." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606816/index.pdf.
Анотація:
Water distribution networks are being designed by traditional methods based on rules-of-thumb and personal experience of the designer. However, since there is no unique solution to any network design, namely there are various combinations of
pipes, pumps, tanks all of which satisfy the same pressure and velocity restrictions, it is most probable that the design performed by traditional techniques is not the optimum one.
This study deals how an optimization technique can be a useful tool for a designer during the design to find a solution. The method used within the study is the partial enumeration technique developed by Gessler. The technique is applied by a
commercially available software, i.e. WADISO SA. The study is focused on discrepancies between a network designed by traditional techniques and the same network designed by partial enumeration method. Attention is given to steps of enumeration, which are basically grouping of pipes, candidate pipe size and price function assignments, to demonstrate that the designers can control all the phases of optimization process. In this respect, special attention is given to price functions to show the effect of them on the result. The study also revealed that the cost of fitting materials cannot be included in the price function although it may have significant
effect in a system composed of closely located junctions.
The results obtained from this study are useful to show that although optimization methods do not provide a definite solutionpartial enumeration method can assist designers to select the optimum system combination.
Книги з теми "Distribution network design Problem":
1
Lakervi, E. Electricity distribution network design. London: P. Peregrinus on behalf of the Institution of Electrical Engineers, 1989.
2
Lakervi, E. Electricity distribution network design. 2nd ed. London: Peter Peregrinus Ltd., on behalf of the Institution of Electrical Engineers, 2003.
3
Dr, Novak Istvan, ed. Power distribution network design methodologies. Chicago, IL: International Engineering Consortium, 2008.
4
Zhu, Qing K. Power Distribution Network Design For VLSI. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2004. http://dx.doi.org/10.1002/0471660302.
5
Jones, Gerard F. Gravity-driven water flow in networks: Theory and design. Hoboken, N.J: Wiley, 2010.
6
Fiambolis, Panagiotis. A network design architecture for distribution of generic scene graphs. Monterey, Calif: Naval Postgraduate School, 1999.
7
Cesario, Lee. Modeling, analysis, and design of water distribution systems. Denver, CO: American Water Works Association, 1995.
8
Ben-Ayed, Omar. Solving a real world highway network design problem using bilevel linear programming. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1988.
9
McDonnell, Janet Theresa. Supporting engineering design using knowledge based systems technology with a case study in electricity distribution network design. Uxbridge: Brunel University, 1994.
10
Ben-Ayed, Omar. Construction of a real world bilevel linear program of the highway network design problem. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1988.
Частини книг з теми "Distribution network design Problem":
1
Snoussi, Islem, Nadia Hamani, Nassim Mrabti, and Lyes Kermad. "Robust Optimization for Collaborative Distribution Network Design Problem." In IFIP Advances in Information and Communication Technology, 280–88. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85969-5_25.
2
Snoussi, Islem, Nadia Hamani, Nassim Mrabti, and Lyes Kermad. "Correction to: Robust Optimization for Collaborative Distribution Network Design Problem." In IFIP Advances in Information and Communication Technology, C1. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85969-5_76.
3
Wu, Yan, Weiqing Tao, Yingjie Zhang, and Xueting Li. "Mixed Communication Design of Phasor Data Concentrator in Distribution Network." In Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications, 84–92. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_10.
Анотація:
AbstractPhase Data Concentrator (PDC) is an important part of Wide Area Measurement System (WAMS) and is widely used in transmission systems. WAMS technology will also be applied in smart distribution network, which has many nodes, complex architecture and various types of data transmission services, and a single communication mode cannot meet its needs. In order to solve this problem, this paper first introduces the composition of WAMS system, communication network mode, and discusses the access layer communication network mode. According to the main station, sub-station interaction process design a synchronous phase data set device that can carry out up-down communication and mix network by various means of communication. Finally, the experimental environment of Power Line Carrier (PLC) and twisted pair network communication is set up to verify.
4
Tang, Xin, Fabien Lehuédé, and Olivier Péton. "A Facility Location Problem for the Design of a Collaborative Distribution Network." In Internet and Distributed Computing Systems, 364–71. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45940-0_33.
5
Retana-Blanco, Brenda, Jose Antonio Marmolejo-Saucedo, Roman Rodriguez-Aguilar, and Erika Pedraza-Arroyo. "Backbone Distribution Network Design for the Mexican Automotive Industry." In Data Analysis and Optimization for Engineering and Computing Problems, 41–60. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48149-0_4.
6
Fleischmann, Bernhard. "European Aspects of the Distribution Network Design. Problems and Models." In Operations Research Proceedings 1993, 211. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-78910-6_74.
7
Bermudez, Carlos, Carolina Salto, and Gabriela Minetti. "Solving the Multi-Period Water Distribution Network Design Problem with a Hybrid Simulated Anealling." In Communications in Computer and Information Science, 3–16. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20787-8_1.
8
Selim, Hasan, and Irem Ozkarahan. "Application of Fuzzy Multi-objective Programming Approach to Supply Chain Distribution Network Design Problem." In Lecture Notes in Computer Science, 415–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11925231_39.
9
Singh, Tejinder Pal, Nicoleta Neagu, Michele Quattrone, and Philippe Briet. "A Decomposition Approach to Solve Large-Scale Network Design Problems in Cylinder Gas Distribution." In Operations Research and Enterprise Systems, 265–84. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17509-6_18.
10
Cruz-Chávez, Marco Antonio, Érika Yesenia Ávila-Melgar, Martín Heriberlo Cruz-Rosales, Beatriz Martínez-Bahena, and Guillermo Flores-Sánchez. "Search Space Analysis for the Combined Mathematical Model (Linear and Nonlinear) of the Water Distribution Network Design Problem." In Artificial Intelligence and Soft Computing, 347–59. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07173-2_30.
Тези доповідей конференцій з теми "Distribution network design Problem":
1
Sun, Hua, and Ziyou Gao. "Robust Alpha-Reliable Network Design Problem under Distribution-free Demand." In 2012 Fifth International Joint Conference on Computational Sciences and Optimization (CSO). IEEE, 2012. http://dx.doi.org/10.1109/cso.2012.105.
2
Sun, Defeng, and Gongshu Wang. "Benders approach for a bulk material distribution network design problem." In 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC). IEEE, 2016. http://dx.doi.org/10.1109/itnec.2016.7560360.
3
Pecci, Filippo, Ivan Stoianov, and Avi Ostfeld. "Optimal Design-for-Control of Water Distribution Networks via Convex Relaxation." In 2nd WDSA/CCWI Joint Conference. València: Editorial Universitat Politècnica de València, 2022. http://dx.doi.org/10.4995/wdsa-ccwi2022.2022.14267.
Анотація:
This paper considers joint design-for-control problems in water distribution networks (WDNs), where locations and operational settings of control actuators are simultaneously optimized. We study two classes of optimal design-for-control problems, with the objectives of controlling pressure and managing drinking-water quality. First, we formulate the problem of optimal placement and operation of valves in water networks with the objective of minimizing average zone pressure, while satisfying minimum service requirements. The resulting mixed-integer non-linear optimization problem includes binary variables representing the unknown valve locations, and continuous variables modelling the valves’ operational settings. In addition, water utilities aim to maintain optimal target chlorine concentrations, sufficient to prevent microbial contamination, without affecting water taste and odour, or causing growth of disinfectant by-products. We consider the problem of optimal placement and operation of chlorine booster stations, which reapply disinfectant at selected locations within WDNs. The objective is to minimize deviations from target chlorine concentrations, while satisfying lower and upper bounds on the levels of chlorine residuals. The problem formulation includes discretized linear PDEs modelling advective transport of chlorine concentrations along network pipes. Moreover, binary variables model the placement of chlorine boosters, while continuous variables include the boosters’ operational settings. Computing an exact solution for the considered mixed-integer optimization problems can be computationally impractical when large water network models are considered. We investigate scalable heuristic methods to enable the solution of optimal design-for-control problems in large WDNs. As a first step, we solve a convex relaxation of the considered mixed-integer optimization problem. Then, starting from the relaxed solution, we implement randomization and local search to generate candidate design configurations. Each configuration is evaluated by implementing continuous optimization methods to optimize the actuators’ control settings and compute feasible solutions for the mixed-integer optimization problem. Moreover, the solution of the convex relaxation yields a lower bound to the optimal value of the original problem, resulting in worst-case estimates on the level of sub-optimality of the computed solutions We evaluate the considered heuristics to solve problems of optimal placement and operation of valves and chlorine boosters in water networks. As case study, we utilize an operational water network from the UK, with varying sizes and levels of connectivity and complexity. The convex heuristics are shown to generate good-quality feasible solutions in all problem instances with bounds on the optimality gap comparable to the level of uncertainty inherent in hydraulic and water quality models. Future work should investigate the formulation and solution of multiobjective optimization problems for the optimization of pressure and water quality, to evaluate the trade-offs between these two objectives. Moreover, the formulation and solution of robust optimization problems for the design of water networks under uncertainty is the subject of future work.
4
Kahler, Jens, and Bogumil Ulanicki. "Discussion of Network Design and Scheduling Problems." In Eighth Annual Water Distribution Systems Analysis Symposium (WDSA). Reston, VA: American Society of Civil Engineers, 2008. http://dx.doi.org/10.1061/40941(247)81.
5
Tsiami, Lydia, Christos Makropoulos, and Dragan Savic. "A review on staged design of water distribution networks." In 2nd WDSA/CCWI Joint Conference. València: Editorial Universitat Politècnica de València, 2022. http://dx.doi.org/10.4995/wdsa-ccwi2022.2022.14516.
Анотація:
Water distribution networks (WDNs) evolve continuously over time. Changes in water demands and pipe deterioration require construction upgrades to be performed on the network during its entire lifecycle. However, strategically planning WDNs, especially for the long term, is a challenging task. This is because parameters that are essential for the description of WDNs in the future, such as climate, population and demand transitions, are characterized by deep uncertainty. To cope with future uncertainty, and avoid overdesign or costly unplanned and reactive interventions, research is moving away from the static design of WDNs. Dynamic design approaches, aim to make water networks adaptive to changing conditions over long planning horizons. A promising, dynamic design approach is the staged design of WDNs, in which the planning horizon is divided into construction phases. This approach allows short-term interventions to be made, while simultaneously considering the expected long-term network growth outcomes. The aim of this paper is to summarize the current state of the art in staged design of water distribution networks. To achieve that, we critically examined relevant publications and classified them according to their shared key characteristics, such as the nature of the design problem (new or existing network design, expansion, strengthening, and rehabilitation), problem formulation (objective functions, length of planning horizon), optimization method, and uncertainty considerations. In the process, we discuss the latest findings in the literature, highlight the major contributions of staged design on water distribution networks, and suggest future research directions.
6
Carmona Benitez, Rafael B., Esther Segura, and Angelica Lozano. "Inventory service-level optimization in a distribution network design problem using heterogeneous fleet." In 2014 IEEE 17th International Conference on Intelligent Transportation Systems (ITSC). IEEE, 2014. http://dx.doi.org/10.1109/itsc.2014.6958065.
7
Qin, X. W., and X. Liu. "The integrated distribution network design problem with transportation economies-of-scale: Model and algorithm." In 2008 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI). IEEE, 2008. http://dx.doi.org/10.1109/soli.2008.4686630.
8
Wang, Xiaoqing, Minmin Qiu, Hongwei Ding, Jin Dong, and Wei Wang. "A carbon capture and distribution network design problem for carbon emission reduction and utilization." In 2010 IEEE International Conference on Service Operations and Logistics and Informatics (SOLI). IEEE, 2010. http://dx.doi.org/10.1109/soli.2010.5551571.
9
Dai, Hang, and Qing Wang. "Reverse Logistics Network Design for the Collection of End-of-Life Vehicles." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71322.
Анотація:
Reverse logistic network design problems involve strategic decisions which influence tactical and operational decisions. In particular, they involve facility location, transportation and inventory decisions, which affect the cost of the distribution system and the quality of the customer service level. Locating a collection centre is an important strategic decision, as purchasing or building facilities requires sizable investment; also the network transportation cost is affected by the selection of facility locations. The location that is selected must therefore take into account all the parameters and variables that are relevant and the decision may even affect demand. In this paper, network design for reverse logistics is investigated to solve the End-of-life Vehicles (ELV) collection centres location problem. We start by giving an understanding of the process of this reverse logistics network design by considering the features of reverse logistics, the role of ELV management and use of optimization methods. Based on this, a reverse logistics network design case for collection of End-of-life Vehicles is presented by formulating the problem into a mixed-integer linear program (MILP), taking into consideration the Capacitated Facility Location Problem. The solution to this model is obtained using IBM CPLEX Optimization Studio©. In addition the applicability of the model in other reverse logistic networks is discussed and the subjects for further research are pointed out.
10
Chen, Zhiya, Dezhi Zhang, and Shuangyan Li. "An optimization Model and its Solution Algorithm for Distribution Network Design Problem with uncertainty demand." In 2007 IEEE International Conference on Automation and Logistics. IEEE, 2007. http://dx.doi.org/10.1109/ical.2007.4338935.
Звіти організацій з теми "Distribution network design Problem":
1
Niven-Jenkins, B., F. Le Faucheur, and N. Bitar. Content Distribution Network Interconnection (CDNI) Problem Statement. RFC Editor, September 2012. http://dx.doi.org/10.17487/rfc6707.
2
Clayton, D. A., J. M. Jansen, Jr., R. W. Hayes, and T. W. Hayes. Building distribution system design criteria for the ORNL/interplant broadband network. Office of Scientific and Technical Information (OSTI), December 1987. http://dx.doi.org/10.2172/6757592.
3
Eldridge, Brent, and Li He. Distribution Network Capacity Market Design: Marginal Distribution Capacity Pricing Mechanism for Efficient Investment and Cost Allocation. Office of Scientific and Technical Information (OSTI), October 2023. http://dx.doi.org/10.2172/2327023.
4
Fuentes, Rolando. Distribution Networks Tariff Design in the Era of Decentralization: A Business Model Approach. King Abdullah Petroleum Studies and Research Center, November 2020. http://dx.doi.org/10.30573/ks--2020-dp24.
Анотація:
In this paper we discuss the unexplored two-way relationship between distribution network tariff design and the emergence of new business models in the power sector. Distribution network tariffs have traditionally used a cost accounting method. We suggest, instead, the use of a business model framework to analyze the extent to which emerging business models in the power sector change the way electricity distribution network services are priced and packaged.
5
She, Ruifeng, and Yanfeng Ouyang. Generalized Link-Cost Function and Network Design for Dedicated Truck-Platoon Lanes to Improve Energy, Pavement Sustainability, and Traffic Efficiency. Illinois Center for Transportation, November 2021. http://dx.doi.org/10.36501/0197-9191/21-037.
Анотація:
Recent development of autonomous and connected trucks (ACT) has provided the freight industry with the option of using truck platooning to improve fuel efficiency, traffic throughput, and safety. However, closely spaced and longitudinally aligned trucks impose frequent and concentrated loading on pavements, which often accelerates pavement deterioration and increases the life cycle costs for the highway agency. Also, effectiveness of truck platooning can be maximized only in dedicated lanes; and its benefits and costs need to be properly balanced between stakeholders. This paper proposes a network-design model to optimize (i) placement of dedicated truck-platoon lanes and toll price in a highway network, (ii) pooling and routing of ACT traffic from multiple origins and destinations to utilize these lanes, and (iii) configuration of truck platoons within these lanes (e.g., lateral displacements and vehicle separations). The problem is formulated as an integrated bi-level optimization model. The upper level makes decisions on converting existing highway lanes into dedicated platoon lanes, as well as setting user fees. The lower-level decisions are made by independent shippers regarding the choice of routes and use of platoon lanes vs. regular lanes; and they collectively determine truck traffic in all lanes. Link-cost functions for platoon lanes are obtained by simultaneously optimizing, through dynamic programming, pavement-rehabilitation activities and platoon configuration in the pavement's life cycle. A numerical case study is used to demonstrate the applicability and performance of the proposed model framework over the Illinois freeway system. It is shown that the freight traffic is effectively channelized on a few corridors of platoon lanes and, by setting proper user fees to cover pavement-rehabilitation costs, systemwide improvements for both freight shippers and highway agencies can be achieved.
6
Kompaniets, Alla, Hanna Chemerys, and Iryna Krasheninnik. Using 3D modelling in design training simulator with augmented reality. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3740.
Анотація:
The article is devoted to the theoretical consideration of the problem and the use of innovative technologies in the educational process in the educational establishment of secondary education in the process of studying the school course of computer science. The main advantages of using educational simulators in the educational process are considered, based on the new state standard of basic and complete general secondary education. Based on the analysis of scientific and methodological literature and network sources, the features of the development of simulators for educational purposes are described. Innovative tools for simulator development have been investigated, as augmented reality with the use of three-dimensional simulation. The peculiarities of using a simulator with augmented reality when studying the topic of algorithmization in the course of studying a school computer science are considered. The article also describes the implementation of augmented reality simulator for the formation of algorithmic thinking skills by students, presents the results of development and describes the functionality of the software product. In the further prospects of the study, it is planned to conduct an experimental study to determine the effectiveness of the use of software development in the learning process.
7
Leis, Sherry, Mike DeBacker, Lloyd Morrison, Gareth Rowell, and Jennifer Haack. Vegetation community monitoring protocol for the Heartland Inventory and Monitoring Network: Narrative, Version 4.0. Edited by Tani Hubbard. National Park Service, November 2022. http://dx.doi.org/10.36967/2294948.
Анотація:
Native and restored plant communities are part of the foundation of park ecosystems and provide a natural context to cultural and historical events in parks throughout the Heartland Inventory and Monitoring Network (HTLN). Vegetation communities across the HTLN are primarily of three types: prairie, woodland, and forest. Park resource managers need an effective plant community monitoring protocol to guide the development and adaptation of management strategies for maintaining and/or restoring composition and structure of prairies, woodland, and forest communities. Our monitoring design attempts to balance the needs of managers for current information and the need for insight into the changes occurring in vegetation communities over time. This monitoring protocol consists of a protocol narrative (this document) and 18 standard operating procedures (SOPs) for monitoring plant communities in HTLN parks. The scientific objectives of HTLN plant community monitoring are to (1) describe the species composition, structure, and diversity of prairie, woodland, and forested communities; (2) determine temporal changes in the species composition, structure and diversity of prairie, woodland, and forested communities; and (3) determine the relationship between temporal and spatial changes and environmental variables, including specific management practices where possible. This protocol narrative describes the sampling design for plant communities, including the response design (data collection methods), spatial design (distribution of sampling sites within a park), and revisit design (timing and frequency of monitoring visits). Details can be found in the SOPs, which are listed in the Revision History section and available at the Integrated Resource Management Applications (IRMA) website (irma.nps.gov). Other aspects of the protocol summarized in the narrative include procedures for data management and reporting, personnel and operating requirements, and instructions for how to revise the protocol.
8
Ruvinsky, Alicia, Timothy Garton, Daniel Chausse, Rajeev Agrawal, Harland Yu, and Ernest Miller. Accelerating the tactical decision process with High-Performance Computing (HPC) on the edge : motivation, framework, and use cases. Engineer Research and Development Center (U.S.), September 2021. http://dx.doi.org/10.21079/11681/42169.
Анотація:
Managing the ever-growing volume and velocity of data across the battlefield is a critical problem for warfighters. Solving this problem will require a fundamental change in how battlefield analyses are performed. A new approach to making decisions on the battlefield will eliminate data transport delays by moving the analytical capabilities closer to data sources. Decision cycles depend on the speed at which data can be captured and converted to actionable information for decision making. Real-time situational awareness is achieved by locating computational assets at the tactical edge. Accelerating the tactical decision process leverages capabilities in three technology areas: (1) High-Performance Computing (HPC), (2) Machine Learning (ML), and (3) Internet of Things (IoT). Exploiting these areas can reduce network traffic and shorten the time required to transform data into actionable information. Faster decision cycles may revolutionize battlefield operations. Presented is an overview of an artificial intelligence (AI) system design for near-real-time analytics in a tactical operational environment executing on co-located, mobile HPC hardware. The report contains the following sections, (1) an introduction describing motivation, background, and state of technology, (2) descriptions of tactical decision process leveraging HPC problem definition and use case, and (3) HPC tactical data analytics framework design enabling data to decisions.
9
Gunay, Selim, Fan Hu, Khalid Mosalam, Arpit Nema, Jose Restrepo, Adam Zsarnoczay, and Jack Baker. Blind Prediction of Shaking Table Tests of a New Bridge Bent Design. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, November 2020. http://dx.doi.org/10.55461/svks9397.
Анотація:
Considering the importance of the transportation network and bridge structures, the associated seismic design philosophy is shifting from the basic collapse prevention objective to maintaining functionality on the community scale in the aftermath of moderate to strong earthquakes (i.e., resiliency). In addition to performance, the associated construction philosophy is also being modernized, with the utilization of accelerated bridge construction (ABC) techniques to reduce impacts of construction work on traffic, society, economy, and on-site safety during construction. Recent years have seen several developments towards the design of low-damage bridges and ABC. According to the results of conducted tests, these systems have significant potential to achieve the intended community resiliency objectives. Taking advantage of such potential in the standard design and analysis processes requires proper modeling that adequately characterizes the behavior and response of these bridge systems. To evaluate the current practices and abilities of the structural engineering community to model this type of resiliency-oriented bridges, the Pacific Earthquake Engineering Research Center (PEER) organized a blind prediction contest of a two-column bridge bent consisting of columns with enhanced response characteristics achieved by a well-balanced contribution of self-centering, rocking, and energy dissipation. The parameters of this blind prediction competition are described in this report, and the predictions submitted by different teams are analyzed. In general, forces are predicted better than displacements. The post-tension bar forces and residual displacements are predicted with the best and least accuracy, respectively. Some of the predicted quantities are observed to have coefficient of variation (COV) values larger than 50%; however, in general, the scatter in the predictions amongst different teams is not significantly large. Applied ground motions (GM) in shaking table tests consisted of a series of naturally recorded earthquake acceleration signals, where GM1 is found to be the largest contributor to the displacement error for most of the teams, and GM7 is the largest contributor to the force (hence, the acceleration) error. The large contribution of GM1 to the displacement error is due to the elastic response in GM1 and the errors stemming from the incorrect estimation of the period and damping ratio. The contribution of GM7 to the force error is due to the errors in the estimation of the base-shear capacity. Several teams were able to predict forces and accelerations with only moderate bias. Displacements, however, were systematically underestimated by almost every team. This suggests that there is a general problem either in the assumptions made or the models used to simulate the response of this type of bridge bent with enhanced response characteristics. Predictions of the best-performing teams were consistently and substantially better than average in all response quantities. The engineering community would benefit from learning details of the approach of the best teams and the factors that caused the models of other teams to fail to produce similarly good results. Blind prediction contests provide: (1) very useful information regarding areas where current numerical models might be improved; and (2) quantitative data regarding the uncertainty of analytical models for use in performance-based earthquake engineering evaluations. Such blind prediction contests should be encouraged for other experimental research activities and are planned to be conducted annually by PEER.
10
Batlle, Carlos. Analysis of the impact of increased Non-Conventional Renewable Energy generation on Latin American Electric Power Systems. Inter-American Development Bank, January 2014. http://dx.doi.org/10.18235/0007960.
Анотація:
The new renewable sources, such as sun or wind, show a specific set of characteristics such as geographical and temporal variability that challenge their integration into traditional energy systems to supply electricity. These aspects have a great impact in the operation of electricity systems that go from the need for generation reserve in the system in order to guarantee operational reliability to possible changes in network and electricity infrastructure planning. The report is structured as follows: Section 1 provides an overview of renewables in Latin America; Section 2 includes a conceptual analysis of how the penetration of NCREs impacts power systems; ection 3 provides a brief description of some solutions being or which could be applied to optimize the penetration of NCREs while maximizing it; Section 4 discusses some basic conceptual aspects that should be considered when dealing with the problem of long-term power system planning; Section 5 provides a general review of the main computer approaches being applied or studied in order to support decision-making for expanding electricity systems, for both the generation and the network side (transmission and distribution); Section 6 analyzes a series of experiences from a selection of Latin American countries. The aim is to briefly describe how each country is conducting its planning processes, focusing on the computer tools being used; Finally, Section 7 provides conclusions and improvement recommendations.