Rozprawy doktorskie na temat „Distribution network design Problem”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Distribution network design Problem”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
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.
Pełny tekst źródłaRajagopalan, Sreekanth. "Design and Maintenance Planning Problems in Commodity Distribution and Chemical Site Networks". Research Showcase @ CMU, 2018. http://repository.cmu.edu/dissertations/1141.
Pełny tekst źródłaSubramanian, Shivaram. "Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks". Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/27224.
Pełny tekst źródłaPh. D.
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.
Pełny tekst źródłaBen, Mohamed Imen. "Designing Two-Echelon Distribution Networks under Uncertainty". Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0073.
Pełny tekst źródłaWith 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
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.
Pełny tekst źródłaSustainability 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
Balakrishnan, Anantaram, Thomas L. Magnanti i Prakash Mirchandani. "The Multi-Network Design Problem". Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5200.
Pełny tekst źródłaMelovic, Dejan. "Optimal distribution network design policy". Thesis, University of Manchester, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.557289.
Pełny tekst źródłaAkkas, Izzet Saygin. "Reliability Based Water Distribution Network Design". Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607830/index.pdf.
Pełny tekst źródłas 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.
Keles, Gultekin. "Water Distribution Network Design By Partial Enumeration". Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606816/index.pdf.
Pełny tekst źródłapartial enumeration method can assist designers to select the optimum system combination.
Luan, Hao. "Peer-to-peer content distribution network design /". View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20LUAN.
Pełny tekst źródłaFréchette, Alexandre. "Hub routing for the robust network design problem". Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=114431.
Pełny tekst źródłaLe design de réseaux robustes (RND) est celui qui applique le concept de robustesse, issu de l'optimisation avec incertitude, au domaine de la conception de réseaux. Les principales motivations derrière cette application découlent de demandes provenant des réseaux de télécommunication. La prémisse principale est que les demandes à travers les réseaux sont variables ou imprévisibles. Toutefois, nous savons que ces demandes proviennent d'un ensemble prédéfini appelé univers de demandes. De plus, des contraintes pratiques du design de réseaux requiert que le routage des demandes soit inconscient, ou fixé d'avance, et qu'il ne dépende pas d'une instanciation particulière de l'univers de demandes. Des contraintes additionnelles, connues sous le nom de modèle de routage, s'appliquent souvent à la structure du routage. Les routages par chemins les plus courts (SP) et par moyeu unique (HUB) ont reçu une attention importante, tant au niveau théorique que pratique. Dans cette thèse, nous introduisons un nouveau modèle de routage appelé routage hiérarchique par moyeux (HH), qui est une généralisation de HUB. Nous étudions les propriétés théoriques de RND restreint à HH (RNDHH). Plus particulièrement, nous démontrons son caractère APX-difficile et fournissons un algorithme O(log n)-approché. Par la suite, nous montrons comment RNDHH devient facilement soluble lorsque restreint à un univers de demandes particulier, basé sur des demandes qui peuvent être routées sur un arbre donné. Nous comparons également le coût des solutions optimales lorsque RND utilise HH ainsi que d'autres modèles de routage inconscients importants. Finalement, nous exploitons HH dans une étude pratique sur un nouvel univers de demandes, appelé modèle par tuyaux restreints, qui est un mélange de deux univers de demandes largement utilisés soit le modèle par tuyaux et le modèle par conduits. Nous utilisons le modèle par tuyaux restreints pour caractériser quel univers de demandes favorise un routage similaire à SP contrairement à un routage HH. Pour ce faire, nous développons un algorithme heuristique pour RNDHH et évaluons notre approche par rapport à SP à l'aide de réseaux d'opérateur ainsi que plusieurs types de demandes du modèle par tuyaux restreints, ceux-ci ayant été paramétrés par leur similitude à un modèle par tuyaux ou un modèle par conduits. Cette étude révèle les conditions à travers lesquelles le routage par multiples moyeux, c'est-à-dire HH, surpasse celui par HUB et SP.
Zorgani, Nagib Youssef. "The Design of FTTH Network". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-221007.
Pełny tekst źródłaPeixoto, Alan Bessa Gomes. "The Inspections problem in the network distribution of electricity: an evolutionary approach". Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15835.
Pełny tekst źródłaThe planning of preventive maintenance is key role in the performance and quality of service of a power utility. The control of vegetation in the process of the electricity distribution network maintenance is of great importance to and continuous improvement of quality indicators of electricity supply, accompanied by the National Electric Energy Agency (ANEEL). The degree of criticality of pruning and productivity of teams are critical in this process. To resolve this issue it proposed a routing algorithm, in order to meet all the anomalies detected in previews, ensuring priority execution of critical cases within the period of maturity of the anomalies and before the occurrence of the failure. A genetic algorithm was developed and applied in solving this problem. The proposed technique has been adapted to a practical case of an electric utility and contributed a good economy and gains in productivity compared the current situation.
O planejamento da manutenÃÃo preventiva à papel fundamental para o bom desempenho e qualidade dos serviÃos prestados de uma concessionÃria de energia. O controle da vegetaÃÃo no processo de manutenÃÃo da rede de distribuiÃÃo de energia elÃtrica à de grande importÃncia para e melhoria contÃnua dos indicadores de qualidade do fornecimento de energia elÃtrica, acompanhado pela AgÃncia Nacional de Energia ElÃtrica (ANEEL). O grau de criticidade da poda e produtividade das equipes sÃo fatores crÃticos neste processo. Para resolver este problema foi proposto um algoritmo de roteirizaÃÃo, com o objetivo de atender todas as anomalias detectadas em inspeÃÃes prÃvias, garantindo a execuÃÃo prioritÃria dos casos mais crÃticos, dentro do prazo do vencimento das anomalias e antes da ocorrÃncia da falha. Um Algoritmo GenÃtico foi desenvolvido e aplicado na resoluÃÃo deste problema. A tÃcnica proposta foi adaptada a um caso prÃtico de uma concessionÃria de energia elÃtrica e contribuiu com uma boa economia e ganhos em produtividade, quando comparada a situaÃÃo atual.
Bouras, Ikram. "Fixed charge network design problem with user-optimal flows". Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS136.
Pełny tekst źródłaThis thesis addresses a class of bi-level network design problems. We are interested in investigating applications from different domains and in developing exact algorithms to solve the corresponding bi-level network problem. In particular, we study a bi-level network design problem where the leader selects a part of the network to be activated, then, in the second level, the solution must be optimal for a network flow problem in the selected sub-network. In this thesis, three applications of this problem are studied: hazmats transportation, telecommunication, and social networks analysis. The second level problem in the first and the last applications is a shortest path problem while a minimum cost flow is required in the second application.The first studied problem is the fixed charge network design problem with shortest path constraints, which is modeled as a bi-level program and can be applied in hazardous transportation. For this problem, we propose two new binary integer programming (BILP) formulations inspired by path and cycle inequalities. We incorporate these formulations in a branch-and-cut algorithm and another cutting-plane based method. Numerical experiments are performed on real instances, and random data sets generated with different criteria to examine the difficulty of the instances. The results show that the proposed cutting plane algorithms can solve up to 19% more instances than the compact formulations.The second studied problem is the energy-aware traffic engineering while using multi-path routing to minimize link capacity utilization in ISP backbone networks. We propose a bi-level optimization model where the upper level represents the energy management function, and the lower one refers to the deployed multi-path routing protocol. Then, we reformulate it as a one-level MILP replacing the second level problem by different sets of flow optimality conditions. We further use these formulations to solve the problem with classical cutting plane and branch-and-cut algorithms. The computational experiments are performed on real instances to compare the proposed algorithms and to evaluate the efficiency of our model against existing single-path and multi-objective models.Finally, we study the problem of maximization influence in signed social networks. To the best of our knowledge, it is the first time that this problem is modeled as a bi-level programming problem. We reformulate the problem as one-level MILP models using three different optimality conditions of the shortest path problem appearing in the second level. These formulations are strengthened by adding a set of valid inequalities. Computational experiments are performed using random instances to compare the different proposed formulations. Finally, explicit solutions and bounds are proposed for particular cases of instances
Guasch, Rodriguez David. "Reducing total fulfillment costs through distribution network design optimization". Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/80998.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 56-57).
Compared to legacy retailers, online retailers have the potential to better accommodate buyer needs by offering more service time and inventory options. One fundamental operational challenge faced by most online businesses is designing a cost effective distribution network. Based on a fixed number of locations with finite resources, companies strive for finding the cost minimizing formula for fulfilling each customer order while meeting rigorous time constraints. In practice this involves allocating specific geographies to each warehouse and defining the logistic routes serving each customer. In an attempt to address this question, a Mixed Integer Linear Programming model has been developed as a decisionmaking tool for determining the optimal carrier-destination combination at each facility. The resulting algorithm is capable of analyzing thousands of potential shipping lanes and selecting those that minimize overall shipping cost. Based on historical data from customer orders, the model consistently finds an optimal network configuration yielding operational savings on the order of 1.5%. Furthermore, the algorithm can be used to identify near-optimal solutions requiring minor tweaks on the current configuration that produce significant economic gains. This simulation tool can be used on a regular basis to adapt the outbound network to demand fluctuations. However, this phenomenon evinces the existence of a fine trade-off between economic gains and operational feasibility. For that reason, a heuristic for selecting the most robust solution is also proposed.
by David Guasch Rodriguez.
S.M.
M.B.A.
Snoeck, André Cornelis Joseph. "Strategic last-mile distribution network design under demand uncertainty". Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127326.
Pełny tekst źródłaCataloged from the official PDF of thesis.
Includes bibliographical references (pages 167-173).
We propose quantitative models to incorporate demand uncertainty and physical distribution flexibility into the strategic design of last-mile distribution networks. Last-mile distribution typically constitutes the most expensive part of any global supply chain, and it is becoming increasingly complex due to the ongoing boom in e-commerce, the associated rise in customer expectations, and the increasing levels of urbanization. Appropriately designing the underlying distribution networks, including facility location, inventory allocation, and eet composition decisions, is paramount for the ecient operation of both traditional and highly responsive last-mile distribution services. In traditional networks, the order collection and delivery periods are segregated by an order cut-o, rendering the operational distribution problem deterministic.
We propose a stochastic programming model to capture the temporal hierarchy of decision making between strategic decisions made under uncertainty and deterministic operational recourse actions. However, for highly responsive networks, the order collection and delivery periods are intertwined, rendering the operational planning problem dynamic and stochastic. The aggregations and approximations required to formulate a tractable stochastic programming model fail to accurately capture the constraining impact of the strategic design on the operational response to dynamically realizing demand. Therefore, we propose a metamodel simulation-based optimization approach to address the design problem for highly responsive last-mile services. In this approach, we integrate a high-level analytical metamodel with an in-depth, disaggregate simulator.
We show that including demand uncertainty in the design process leads to networks that incorporate redundancy and flexibility in the strategic design, resulting in increased cost performance. Based on a study with a fast-moving consumer goods company that operates traditional distribution networks in emerging economies, we show that a stochastic design approach outperforms deterministic approaches, with and without embedding physical distribution flexibility in the network. In addition, we conduct a study with a global fashion company that aims to deploy a one-hour delivery service in Manhattan, NY. We show how congestion in order processing at facilities leads to picking queues that harm performance by an increase in late-delivery and a reduction in consolidation opportunities. Furthermore, we show that incorporating uncertainty allows to accurately incorporate local stock-out inventory effects.
Based on a generalization of the newsvendor model, we analytically show the potential for cost reduction that emerges from leveraging existing brick-and-mortar assets, including inventory positions and retail stores, in highly responsive distribution networks.
by André Cornelis Joseph Snoeck.
Ph. D. in Transportation
Ph.D.inTransportation Massachusetts Institute of Technology, Department of Civil and Environmental Engineering
Hodgdon, Tammy Jo. "A Combined Inventory-Location Model for Distribution Network Design". Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/35892.
Pełny tekst źródłaMaster of Science
Dahan, Mathieu. "Network security and min-cost max-flow problem". Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104555.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (pages 92-93).
Network optimization has widely been studied in the literature for a variety of design and operational problems. This has resulted in the development of computational algorithms for the study of classical operations research problems such as the maximum flow problem, the shortest path problem, and the network interdiction problem. However, in environments where network components are subject to adversarial failures, the network operator needs to strategically allocate at least some of her resources (e.g., link capacities, network flows, etc.) while accounting for the presence of a strategic adversary. This motivates the study of network security games. This thesis considers a class of network security games on flow networks, and focuses on utilizing well-known results in network optimization toward the characterization of Nash equilibria of this class of games. Specifically, we consider a 2-player strategic game for network routing under link disruptions. Player 1 (defender) routes flow through a network to maximize her value of effective flow while facing transportation costs. Player 2 (attacker) simultaneously disrupts one or more links to maximize her value of lost flow but also faces cost of disrupting links. Linear programming duality and the Max-Flow Min-Cut Theorem are applied to obtain properties that are satisfied in any Nash equilibrium. Using graph theoretic arguments, we give a characterization of the support of the equilibrium strategies. Finally, we study the conditions under which these results extend to a revised version of the game where both players face budget constraints. Thus, our contribution can be viewed as a generalization of the classical minimum cost maximum flow problem and the minimum cut problem to adversarial environments.
by Mathieu Dahan.
S.M.
De, Schaetzen Werner. "Optimal calibration and sampling design for hydraulic network models". Thesis, University of Exeter, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322278.
Pełny tekst źródłaCeylan, Halim. "A genetic algorithm approach to the equilibrium network design problem". Thesis, University of Newcastle Upon Tyne, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391956.
Pełny tekst źródłaALOISE, DANIEL. "HEURISTICS FOR THE NETWORK DESIGN PROBLEM WITH DISCRETE COST FUNCTIONS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6665@1.
Pełny tekst źródłaProblemas de multifluxos surgem como modelos básicos no contexto de várias aplicações de fluxos em redes, tais como redes de telecomunicações, redes de transporte e logística. Em tais aplicações, os fluxos que atravessam a rede compartilham simultaneamente os mesmos recursos disponíveis e são definidos por suas próprias restrições. A cada uma das arestas ligando os pontos da rede está associado um custo, fixo ou proporcional à sua utilização. Este trabalho trata problemas de projeto de redes multifluxos, em que os custos estão associados às capacidades instaladas nas arestas. Particularmente, será estudado o caso em que a função de custo nas arestas possui o comportamento de uma função escada crescente e descontínua, para o qual métodos exatos de resolução são ineficientes. Métodos heurísticos são propostos para a resolução aproximada do problema e sintetizados em um algoritmo de multi-partida com memória adaptativa. Um mecanismo de intensificação, conhecido na literatura como construção de vocabulário, é também explorado e aplicado. Finalmente, experimentos computacionais são realizados e o método de resolução proposto é analisado quanto aos seus resultados e os resultados obtidos pelo método de resolução proposto são analisados. O método obtém as melhores soluções conhecidas para algumas instâncias da literatura.
Multicommodity flow problems arise widely as basic models in the context of network flows applications such as telecommunication networks, transportation problems, and logistic. In these applicatons, the flows that cross the networks share the same avaiable resources simultaneously and are defined by their own constraints. Each edge connecting two nodes in the network has an associated cost that is either fixed or proportional to its use. This work focuses on a network design problem in which the cost are associated with the capacities installed in the edges. Particularly, the network design problem studied has discrete and step increasing cost functions on the edges, for which exact methods are inefficient. Heuristics are proposed for the approximate memory algorithm. An intensification mechanism, known in the literature as vocabulary building, is also explored and applied. Finally, computational experiments are performed and the results obtained with the proposed solution method are evaluated. The method obtains the best known solutions for some instances in the literature.
Fiambolis, Panagiotis Prokopakis Georgios. "A network design architecture for distribution of generic scene graphs /". Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1999. http://handle.dtic.mil/100.2/ADA371846.
Pełny tekst źródła"September 1999". Thesis advisor(s): Michael J. Zyda, Michael V. Capps, John S. Falby. Includes bibliographical references (p. 141-144). Also available online.
Fiambolis, Panagiotis, i Georgios Prokopakis. "A network design architecture for distribution of generic scene graphs". Thesis, Monterey, California. Naval Postgraduate School, 1999. http://hdl.handle.net/10945/8730.
Pełny tekst źródłaSANTO, DANIEL PRADO DO ESPÍRITO. "THE INFLUENCE OF TAX PLANNING IN THE DISTRIBUTION NETWORK DESIGN AND LOCATION OF DISTRIBUTION CENTERS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=26871@1.
Pełny tekst źródłaIncluding tax management in supply chain planning is a profitable differentiating factor, especially in Brazil, where each State exhibits its own tax policy. Some studies have been conducted taking into account the tax issues in the logistics network design, however this thesis takes into account the tax incentives offered by some Brazilian states to attract business. To assess the impact of tax incentives in the distribution network design, it proposed a model for locating distribution centers based on Mixed Integer Linear Programming (MILP) that includes parameters and factors related to the restrictions and opportunities created by Brazilian tax policies. The model is applied to a Brazilian company that sells chemical products. This company is installed in a location away from the end point of delivery of the products due to insertion into a tax incentive program, without adopting any location model for evaluating the strategy. The goal is to determine the actual advantages of a reduction in tax rates offset an increase in logistics transportation costs. The solution determined whether the construction of a new distribution center is beneficial, if the results generated by the model had lower total costs for the new network design compared to the current network.
Parkinson, J. S. "Control system design for low pressure gas distribution networks". Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378367.
Pełny tekst źródłaMascarino, Esteban Ezequiel. "Last-mile network design for urban commodity distribution in Latin America". Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120647.
Pełny tekst źródłaCataloged from PDF version of thesis. Vita.
Includes bibliographical references (pages 76-81).
Transportation, as the carrier of freight and passengers, is undeniably one of the fundamental components required for both economic growth and development. In an urban environment, freight movements support most city-based activities, while detrimentally impacting the quality of life through negative externalities (e.g., congestion, noise and air pollution, etc.). Specifically, last-mile delivery is regarded as an important yet highly expensive section within every supply chain. This is partially caused by inherent inefficiencies such as prolonged delays in traffic and unproductive idle periods at customers locations, among others. Consequently, there is a need for methodologies addressing the design of improved last-mile delivery networks. In this context, the optimal design of distribution systems requires an integrated view of strategic, tactical, and operational decisions. This work contributes with a mathematical framework that provides such an integrated view while leveraging both customer-generated waiting time inefficiencies and existing network infrastructure to serve additional clients. It also provides computationally feasible algorithms to obtain solutions for realistic situations. First, we formulate a single-echelon, multi-depot, capacitated routing problem. Employing a brownfield approach, this model optimizes the fleet composition as well as the delivery schedule and allocation to distribution facilities of medium- and high-dropsize clients, hereafter 'big-box' customers. This Routing Problem (RP) is modeled as a special case of a Bin Packing Problem (BPP) combined with a customer clustering approach. However, given its high combinatorial complexity, two alternative methodologies, a two-step approach and Benders Decomposition (BD), are tested to reduce computational times. Second, we develop a two-echelon extension, which builds on the previous model, to evaluate the economic impact of including a large number of low-dropsize customers, also known as 'nanostores', into the original distribution footprint. Those newly added customers will be served through the second echelon using a subset of the original big-box customer locations as transshipment points. To solve this Location-Routing Problem (LRP), a three-step iterative optimization approach is developed and tested. Both models are applied to a real-world consumer goods distribution case study in Latin America. Results suggest that a systematic and properly framed optimization approach, which makes efficient use of available resources, can significantly reduce the total distribution cost. Further, we show that the case study company, leveraging its existing assets and addressing inherent network inefficiencies, can efficiently expand its distribution footprint towards nanostores.
by Esteban Ezequiel Mascarino.
S.M. in Transportation
Atkinson, Stuart. "A futures approach to water distribution and sewer network (re)design". Thesis, University of Exeter, 2013. http://hdl.handle.net/10871/10730.
Pełny tekst źródłaHultman, Gustav. "DISTRIBUTION NETWORK DESIGN : Optimization & simulation of an international supply chain". Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-171754.
Pełny tekst źródłaHöganäs AB's nuvarande distributionsnätverket for järnpulver i Asien-Stillahavsregionen (APAC) är kostsamt till följd av höga lagernivåer och kapitalkostnader. Ökande efterfrågan och krav på hög servicenivå har inneburit en stadig ökning av lagernivåerna, vilket möjliggjort för företaget att upprätthålla servicenivån oberoende av störningar i leveranskedjan eller förändringar i efterfrågan. Det är viktigt att distributionsnätverket är balanserat avseende stabilitet och kostnadseffektivitet och inte endast optimeras avseende en av faktorerna. Syftet med projektet är förse Höganäs AB vetenskapligt understödd information om hur den totala kostnaden för distributionsnätverket kan sänkas samtidigt som kundservicen upprätthålls eller förbättras. Det finns flera mål för projektet. Det första målet är att optimera materialflödet i distributionsnätverket givet empiriska data över efterfrågan. Den avsedda modellen är ett linjärprogram som löser en instans av distributionsnätverkverksdesign-problemet med multipla lager, perioder, produkter, lokaliseringar och transportsätt. Det andra målet är att utvärdera stabiliteten hos de optimala lösningar som härrör från linjärprogrammet genom stokastisk simulering. Simuleringarna använder de optimala nätverksdesigner som genereras av det linjärprogrammet och genomförs för en uppsättning möjliga scenarier där nyckelparametrar ändras. Genom att justera nyckelparametrar och mäta effekten på kostnad och servicenivå är målet att utvärdera stabiliteten för varje konfiguration. Genom att behålla de befintliga noderna i distributionsnätverket och ändra materialflödet samt distributionsstrategin kan lägre lagernivåer uppnås och servicenivån hålls hög oavsett förändrad efterfrågan och störningar i leveranskedjan. Den optimala distributionsnätverkverksdesignen är en lösning från linjärprogrammet konfigurerat med 14 dagars lagernivå och 10 dagars beställningspunkt. Den optimala designen visar att distributionen görs mer stabil och effektiv genom att tillåta leveranser mellan lagerpunkterna eller att försörja kunder från andra lagerpunkter än de normalt försörjs från. Resultatet påvisar också att en strategiskt placerad omlastningscentral kan förbättra det nuvarande distributionsnätverket.
Bullene, Rachel. "A Case Study of Network Design for Middle East Water Distribution". VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2260.
Pełny tekst źródłaSchittekatte, Tim. "Distribution network tariff design and active consumers : a regulatory impact analysis". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS054/document.
Pełny tekst źródłaThe uptake of affordable solar PV panels challenges the way in which costs of distribution networks are recuperated from consumers. Historically, consumers were charged for the use of the distribution network mainly according to their (net) volume of electricity consumed over a period of time. With such volumetric network charges, consumers installing PV panels contribute a lot less towards the recuperation of network costs. However, these consumers (prosumers) still rely on the network as much as they did before. The question investigated in this thesis is how to re-design the distribution network tariff in this changing context. Different game-theoretical models are developed to conduct this analysis. In the models, not only investments in solar PV but also investments in batteries at the consumer-side are considered. The thesis consists of a brief overview followed by four standalone chapters and a conclusion
Wu, Yanghui. "Problem dependent metaheuristic performance in Bayesian network structure learning". Thesis, Robert Gordon University, 2012. http://hdl.handle.net/10059/790.
Pełny tekst źródłaSay, Fatih. "Minimum Concave Cost Multicommodity Network Design". Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606432/index.pdf.
Pełny tekst źródłas Linearization, Minoux greedy and Minoux accelerated greedy methods are found to be applicable to circuit switching network design when both solution quality and computational time is considered. Previously, it has been found that Minoux greedy methods may create routings with cycles and in order to eliminate these cycles a modification has been proposed. In this work, this modification is extended and evaluated in detail. Similarly, Gerla and Kleinrock&rsquo
s Concave Branch Elimination, Gersht&rsquo
s greedy and Stacey&rsquo
s Concave Link Elimination methods are investigated within the context of packet switching network design. All of these methods consider aggregate flows on each link simultaneously re-routing more than one commodity in one step. This thesis work also considers an alternative disaggregate approach, where only one commodity is handled at a time. Finally, algorithms proposed for circuit switching network design problem are adapted to the packet switching case and an extensive comparative computational study is performed to point out the best method with respect to time and solution quality for a number of networks and cost structure. Computational results have shown that modification on Minoux greedy to eliminate cycles leads to considerable improvements and the disaggregate approach gives the best result in some networks and cost structure.
Galymov, Birzhan. "Distribution Network Reconfiguration For Loss Reduction By Multi-branch Exchange Method". Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614663/index.pdf.
Pełny tekst źródłaKao, Yu-Chun, i 高于珺. "Physical distribution network design problem for multi-echelons supply chain". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/60994419218247068623.
Pełny tekst źródła國立高雄第一科技大學
運籌管理研究所
99
This study addresses the design of physical distribution network in multi-echelons supply chain, where the system includes manufacturers, distribution centers and retailers/customers. The problem is formulated as a mixed integer program. The proposed model determines the locations of distribution centers, the transport paths of commodity, and the volumes on the transport paths. An illustrative example and a case study based on a real distribution network were used to test the proposed model. Sensitive analysis was performed to identify some critical factors for the system. The results show that the model is practical and able to provide a promising solution.
Liou, Jyh-Yeuan, i 劉志遠. "The Freight Transportation Network Design Problem for Time Definite Cargo Distribution Carriers". Thesis, 1997. http://ndltd.ncl.edu.tw/handle/03760831760914516418.
Pełny tekst źródła國立成功大學
交通管理(科學)學系
85
Time definite cargo distribution carriers pickup, consolidate and deliver partial loads.The strategy for a successful carrier is to provide services with competitive prices,design a freight transportation network, and implement an efficient operating plan tomaximize its profits. The freight transportation network consists of two sub-networks,line-haul operations and service operations. A proper line-haul operations network canprovide ample opportunities to consolidate partial loads therefore, reducestractor-trailer runs. On the other hand, a proper service network will providenot only convenient facilities but also a high quality services for customers. The hub-and-spoke network is a most commonly used and proven to be an efficientnetwork structure for freight shipments. However, the network structure oftime definite carriers in Taiwan mainly consists of operating spokes(centers).The consolidation function of partial loads is performed in some designated large centerswhich is integrated but often conflicted with pickup and delivery operations.Additionally, the lack of mechanical consolidation facilities, due to insufficient volumes,results in a high sorting cost. In order to avoid high sorting costs, carriers adopt stopover operation. 83% of the feeder runs perform loadingand unloading operations at centers on their routes.Unfortunately, the stopover operation substantially reduces the usable trailer capacitywhich results an ineffective feeder operation. In the near future, the external environments for carriers will be undergo a substantial change.The demand will increase which may exceed carriers'' current capacities.The desire of the Central Government in Taiwan to join WTO may result in aderegulation of the cargo industry to allow the entrance of international carriersfor domestic cargo. The government will also implement a stimulate package tocombat the economic depression. The economic package includes release ofnon-productive farm lands and a construction of 12 additional inter-city expressways.Thus, some of the carriers size this opportunity to totally reconstruct their freighttransportation networks. The network under consideration is based on a hub- and-spokeconfiguration. The whole island of Taiwan will need three major hubs and a high density ofsmall scale centers. The purpose of this research is to study the transportation network design problem for carriers.We investigate the current time definite cargo market to understand the service characteristics. We also survey carriers to gain the insight of the their operational characteristics.With the information of operational restrictions and candidate facility locations,we construct a network design mathematical model for carriers anddevelop a local improvement heuristic algorithm to solve such a NP hard integeprogramming problem. We use one of the three carriers in Taiwan as the numerical examples.
Lu, Min-Xian, i 呂旻憲. "Physical Distribution Network Design Problem for Multi-echelons and Product Supply Chain - A Case Study of W Company". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/e63e5x.
Pełny tekst źródła國立雲林科技大學
工業工程與管理系
104
This study is a network design supply chain for multi-echelons and product. There are many suppliers, factories, DCs and customers, which are three stages in total. Firstly, the products were transported to plants from suppliers, then were produced by factories and stored in DCs secondly, and were transported to customers from DCs finally. It contains the location of suppliers and also it determines the number, transported routing deliveries and flow. During the research, we realized that the problem of three-staged supply chain was NP-hard, thus we develop Genetic Algorithm to solve it. We can solve the problem by Microsoft Excel solver and find the optimal solution for small problems. The result of Genetic Algorithm will be verified from Microsoft Excel solver. The two methods in experimental design adopt the practical situation, but adopting different stages of cost. Discovering the largest influence of cost in total cost then solving it. It can reduce the difficulties and procedures in total.
Sima, Said Athuman. "Integrated stochastic distribution network design: a two-level facility location problem with applications to maize crops transportation in Tanzania". Thesis, 2015. http://hdl.handle.net/10539/18589.
Pełny tekst źródłaA two-level facility location problem (FLP) arose in the transport network of maize crop in Tanzania has been studied. The three layers, namely, production centers (PCs), distribution centers (DCs) and customer points (CPs) are considered in the two-level FLP. The stochastic e ect on the two-level FLP due to rainfall in the network links, between the DCs and CPs, has been studied. The ow of maize crop from PCs to CPs through DCs is designed at a minimum cost under deterministic and stochastic scenarios. The three decisions made simultaneously are: to determine the locations of DCs (including number of DCs), allocation of CPs to the selected DCs, allocation of selected DCs to PCs, and to determine the amount of maize crop transported from PCs to DCs and then from DCs to CPs. We have modelled the problem and generate results by optimizing the model with respect to optimal location-allocation strategies. We have considered two networks, the existing network and an extended network. In the existing network there are four PCs, ve DCs and ninety three CPs. In the extended network three additional DCs are considered. For the modelling purpose we have used the rainfall data from 2007 - 2010 in each week for 17 weeks. The optimized results for the existing network have shown improvements in cost saving compared to the manually operated existing network. In the extended network, the results have shown much more e cient and cost saving distribution system compared to the results of the existing network.
Ng, Man Wo. "Travel time reliability assessment techniques for large-scale stochastic transportation networks". Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-05-1050.
Pełny tekst źródłatext
"The multi-level network design problem". Sloan School of Management, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/2381.
Pełny tekst źródłaShu, Jia, Chung Piaw Teo i Zuo-Jun Max Shen. "Stochastic Transportation-Inventory Network Design Problem". 2002. http://hdl.handle.net/1721.1/4018.
Pełny tekst źródłaSingapore-MIT Alliance (SMA)
Ting, Mu-Jung, i 丁睦容. "Maximum flow problem in the distribution network flow model". Thesis, 2004. http://ndltd.ncl.edu.tw/handle/42267347963163619539.
Pełny tekst źródła國立成功大學
數學系應用數學碩博士班
93
In this paper, we are concerned with the maximum flow problem in the distribution network, a new kind of network recently introduced by Fang and Qi. It differs from the traditional networks by the presence of the D-node through which the commodities are to be distributed proportionally. Adding D-nodes into the network complicates the structure. Particularly, flows in the distribution network are frequently increased through multiple cycles. To this end, we develop a type of depth-first-search algorithm, which counts and finds all unsaturated subgraphs. Those configurations, however, could be invalid either topologically or numerically. The validity are then judged by computing the flow increment with a method we call the multi-labeling method. Finally, we also provide the phase-one procedure for finding an initial flow.
Wang, Shih Yuan, i 王詩媛. "Local Network Design for Pharmaceutical Distribution". Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107CGU05026011%22.&searchmode=basic.
Pełny tekst źródłaAggarwal, Manica. "Approximation algorithms for the network design problem". Thesis, 1997. http://localhost:8080/iit/handle/2074/2224.
Pełny tekst źródłaLin, Shiou-Jie, i 林修杰. "A network simplex algorithm for the minimum distribution cost problem". Thesis, 2006. http://ndltd.ncl.edu.tw/handle/29251223326455251674.
Pełny tekst źródła國立成功大學
工業與資訊管理學系碩博士班
94
The minimum cost flow problem seeks an optimal flow assignment over a network satisfying the node flow balance constraints and arc flow bounds constraints. These constraints are too simplified to model some real cases.To model the distillation or decomposition of products in some manufacturing processes, a minimum distribution cost problem (MDCP) on a specialized manufacturing network flow model has been investigated. In an MDCP, a specialized node called D-node is used to model a distillation process which only connects with a single incoming arc and several outgoing arcs. The flows entering a D-node have to be distributedaccording to a pre-specified ratio associated with each of its outgoing arcs. Such a proportional relationship between the arc flows associated with each D-node complicatesthe problem and makes the MDCP harder than conventional min-cost network flow problem. A network simplex algorithm for uncapacitated MDCP has been outlined in literature, but its detailed graphical procedures such as initial basic feasible solution computation, dual variables updates, and flow pivoting operations have not yet been given. In this thesis, we resolve these issues by upper bound techniques as well as graphical operations which decompose each pivoting graph into several components for calculating both the arc flows and the dual variables. Other issues regarding efficient ways to obtain an initial primal basic feasible solution to start with our algorithm and mathematical insights for solving the MDCP on distribution networks will also be investigated and discussed.
Zhang, Ben. "Distribution Network Design for Distributed Renewable Energy Sources". Thesis, 2014. http://hdl.handle.net/1828/5171.
Pełny tekst źródłaGraduate
0984
Chang, Wen-Hsiang, i 張玟翔. "Power-Distribution-Network Design Methodologies toward Fast Physical-Design Closure". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/699aqd.
Pełny tekst źródła國立交通大學
電子研究所
106
As technology node keeps scaling and design complexity keeps increasing, power distribution network (PDN) require more routing resource to meet IR-drop and EM constraints. In this thesis, we first presented a design flow to build a routing-friendly PDN before placement. The design flow considers the impact of the aluminum-pad layer and the impact of PDN layout configurations. Second, we proposed a dynamic programming (DP) approach to further minimize the routing impact of a given uniform PDN by relocating the power stripes after placement. The results based on a 40nm microprocessor demonstrate that the proposed design flow and the proposed DP approach can effectively generate a routing-friendly PDN and in turn speed up the design closure at the physical-design stage. Finally, we propose a design flow to generate a PDN that can result in a near-minimal total wire length of global route (and in turn detailed route as well) after placement. The design flow uses a machine-learning model to quickly predict the total wire length of global route associated with a given PDN configuration. Experiment results based on 28nm industrial block designs demonstrate that the proposed design flow can generate a routing-friendly PDN and in turn speed up the design closure at the physical-design stage.
Liu, Ying-Wen, i 劉穎文. "A Logistics Network Design Problem Considering Environmental Concerns". Thesis, 2014. http://ndltd.ncl.edu.tw/handle/34159973019236828949.
Pełny tekst źródła國立交通大學
運輸與物流管理學系
102
It is believed that global warming and extreme weathers is a result of the increasing amount of emissions and greenhouse gases. With the rising environmental concerns in the recent years, it is important to take the related emissions into account when designing the freight transportation network. Policy issues for carbon emissions reduction are widely studied, such as, the evaluation of environmental policies, the strategies and techniques for reducing emissions.How to lower the emissions to meet a mandatory cap is also an issue for freight network design problem. This study proposesa bi-level programming formulation to model the policies of emission reduction for freight transport,whereas the lower-level problem is a transportation network assignment problem modeling the network flows, and the upper-level problem determines the most optimal improvement policies for minimizing the improvement costs. Three improvement policies are considered, including enhancing port capacity, subsidy for using a port, and internalization of external cost. Under the bi-level framework, the leader at the upper-level would consider the reaction function of the follower at the lower-level, and the follower would give its feedback to the leader as well, under the Stackelberg equilibrium. A Branch Sensitivity Analysis-Based (Branch-SAB) algorithm is proposed to solve the upper-level problem, in which the sensitivity of the lower-level equilibrium solution respect to the upper-level decision variables is continuous but non-differentiable at certain points, whereas the lower-level model is a linear programming problem and can be solved by the Simplex Method. Numerical example with a hypothetical network is used to demonstrate the performance of the model, and the results show that the improvement policies can reduce the network emissions, subject to a reduction upper bound. A higher improvement cost is needed for a stricter reduction target, but the corresponding network emissions, environmental cost, as well as transportation cost would be decreased.
Chin-ChiaLee i 李晉嘉. "The Network Design Problem of Passenger Railway System". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/04103090902358255750.
Pełny tekst źródła國立成功大學
交通管理科學系
103
Since the railway system plays an important role in transporting passengers around Taiwan, increasing the line capacity is a major issue. For instance, there are many bottlenecks on the Taitung Line, because of 19 single-track sections. The railway line capacity can be increased by upgrading the single-track sections to double-track lines. Increasing transport volumes means that the rail operators should schedule more services. However, services are limited by the railway line capacity and such line capacity is affected by several factors, including train-type heterogeneity, speed and schedule effects. This study has evaluated services for railway line capacity, and has investigated the influence of track design (single-track or double-track) on the number of services and travel times, and has identified the bottlenecks. To solve the problem and find the optimal solution, we have designed Genetic Algorithm by combining the heuristic proposed by Lee and Chen (2009) with regression analysis. When tested with real-world examples from the Taitung Line, the results showed that there are significant differences between single-track and double-track lines. To ensure the quality of the problem solving, we have also used Lee and Chen’s (2009) scheduling timetable algorithm to enumerate the solution. The results prove that our algorithms are able to provide an optimal solution that is both accurate and rapid computationally. This research can provide the Taiwan Railways Administration (TRA) with suggestions for the best locations to upgrade their lines from single-track to double-track under conditions of limited resources.
Lin, Hsiao-Ling, i 林筱玲. "The Network Design Problem of Home-Delivery Carriers". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/56280791099912401804.
Pełny tekst źródła南台科技大學
行銷與流通管理系
96
In recent years, with the prosperous development of electronic commerce and the importance of consumers’ demands for product delivery, the home delivery market is developed more rapidly. However, under the environment of keen competitions among home-delivery carriers, it is the subject of this research how the home delivery effectively can reduce its operating costs and promote its customer services, qualities and revenues to maintain its own competitive advantages. According to our initial understanding, the characteristics of this problem includes the service network, the line-haul operation network and the use of vehicles, all of which belong to a extensive problem of pure hub-and-spoke network. And there is not any related document which has ever studied both issues of line-haul operation network and service network. However, the structure of the overall Network for the foundation, this research is only designed to study the location and the quantity of transit centers and operation stations. This research will build the mathematical mode based on the characteristics of problems to get a solution. And then, this research will frame the heuristic mode to solve the problem of original modes and to get a solution for larger-scale problems. The result of solutions shows that the mathematical mode of this research shall be able to process this problem effectively for further research references.