Dissertations / Theses on the topic 'Facility Location Optimisation Problem'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Facility Location Optimisation Problem.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Venables, Harry. "Ant colony optimisation : a proposed solution framework for the capacitated facility location problem." Thesis, University of Sunderland, 2011. http://sure.sunderland.ac.uk/4061/.
Full textDurán, Mateluna Cristian. "Exact solution methods for large-scale discrete p-facility location problems." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAE001.
Full textThis thesis focuses on the exact solution of the NP-hard problems p-median and p-center, combinatorial optimization problems that quickly become difficult to solve as the instance size increases. These discrete location problems involve opening a defined number p of facilities and then allocating to them a set of clients according to an objective function to be minimized.First, we study the p-median problem, which seeks to minimize the sum of distances between clients and the open facilities to which they are allocated. We develop an algorithm based on Benders decomposition that outperforms state-of-the-art exact methods. The algorithm considers a two-stage approach and an efficient algorithm for separating Benders cuts. The method has been evaluated on over 230 benchmark instances with up to 238025 clients and sites. Many instances are solved to optimality for the first time or have their best known solution improved.Secondly, we explore the p-center problem, which seeks to minimize the largest distance between a client and its nearest open facility. We first compare the five main MILP formulations in the literature. We study the Benders decomposition and also propose an exact algorithm based on a client clustering procedure based on the structure of the problem. All the proposed methods are compared with the state-of-the-art on benchmark instances. The results obtained are analyzed, highlighting the advantages and disadvantages of each method.Finally, we study a robust two-stage p-center problem with uncertainty on node demands and distances. We introduce the robust reformulation of the problem based on the five main deterministic MILP formulations in the literature. We prove that only a finite subset of scenarios from the infinite uncertainty set can be considered without losing optimality. We also propose a column and constraint generation algorithm and a branch-and-cut algorithm to efficiently solve this problem. We show how these algorithms can also be adapted to solve the robust single-stage problem. The different proposed formulations are tested on randomly generated instances and on a case study drawn from the literature
Meeyai, Sutthipong. "A Hybrid Approach for The Design of Facility Location and Supply Chain Network Under Supply and Demand Uncertainty: A Systematic Review." Thesis, Cranfield University, 2009. http://dspace.lib.cranfield.ac.uk/handle/1826/4673.
Full textThangavelu, Balajee. "Single-Facility location problem among two-dimensional existing facility locations." Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1175283985.
Full textWang, Yu Carleton University Dissertation Mathematics and Statistics. "The P-median problem and the uncapacitated facility location problem." Ottawa, 1996.
Find full textKotian, Siddharth R. "PLANAR k-CENTRA SINGLE-FACILITY EUCLIDEAN LOCATION PROBLEM." Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1132796955.
Full textRomero, Montoya Alejandro. "Resilient Facility Location Problem for Supply Chain Design." Ohio University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou152631292582812.
Full textOyewole, Gbeminiyi John. "A Study on Integrated Transportation and Facility Location Problem." Thesis, University of Pretoria, 2019. http://hdl.handle.net/2263/72419.
Full textThesis (PhD)--University of Pretoria, 2019.
Industrial and Systems Engineering
PhD
Unrestricted
Fors, Amanda. "The metric uncapacitated facility location problem : The problem and the approximation algorithms." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-140442.
Full textWu, Tingying. "Models and algorithms for two-echelon capacitated facility location problem with facility size selection." Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLE029.
Full textFacility location is one of the most important strategic decisions for firms in globalization. Previous works on facility location in the literature mainly focus on determining the locations of facilities and the flows of products from facilities to customers with the goal of minimizing the sum of facility opening costs, production and logistic costs. However, it’s very important to determine at the same time the appropriate sizes for these facilities because they greatly affects these costs on the long term. Determining facility location and size is always an open problem.In this thesis, we study three new two-echelon capacitated facility location problems (TECFLP) with facility size selection. The two first parts of the wok focus on two-echelon facility location problems with plant and depot size selection, respectively. The third part concentrates on TECFLP considering simultaneously plant and depot size selection. For these problems, three corresponding mixed integer programming models are formulated and then Lagrangean relaxation approaches according to the problems’ characteristics are developed. To further improve the best solutions obtained by the Lagrangean Relaxation approaches, a tabu search, a hybrid variable neighborhood tabu search and a hybrid simulated annealing tabu search are adapted for the three problems respectively. The developed algorithms are tested and evaluated through 810 randomly generated instances. Computational results show ours algorithms can provide high quality solutions within a reasonable computation time
Fowler, Christopher William. "Heuristic performance for the uncapacitated facility location problem with uncertain data." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/30760.
Full textSevinc, Selim. "A Lagrangean Heuristic For The Two-stage Modular Capacitated Facility Location Problem." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609534/index.pdf.
Full textZarabi, Patrick, and August Denes. "Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms." Thesis, KTH, Optimeringslära och systemteori, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979.
Full textDetta examensarbete inom systemteknik och optimeringslära syftar till att lösa ett lagerplaceringsproblem. Lagret ska ställas inom en liten yta med hänsyn till ruttbegränsningar och närhet till andra byggnader. Denna uppsats är begärd av LKAB Kiruna for att underlätta i deras beslut om var ett nytt lager skulle kunna byggas inom deras industriområde. Lagerplaceringsproblemet delades upp i två problem, huvudproblemet var att lokalisera den basta platsen för lagret att byggas. Subproblemet var hur distanser och tillåtna placeringar ska modelleras i denna specifika kontext med rutt- och narhetsbegränsningar. Distans- och platsmodelleringen gjordes genom att skapa en grafrepresentation av industriområdet. Sedan användes Dijkstras kortaste vägen algoritm för att erhålla alla distanser mellan möjliga byggområden och de produktionsanläggningar som behöver tillgång till lagret. Huvudproblemet kunde sedan lösas med hjälp av dessa distanser och en linjär heltalsoptimeringsmodell. Modellen utökades sedan för att tillåta placeringen av två separata lagerbyggnader. Den utökade modellen löstes med hjälp av tre olika implementeringar, en heuristisk algoritm, en ickelinjär heltalsoptimeringsmodell samt en linjär heltalsoptimeringsmodell. Resultaten visade att implementeringen av det ursprungliga lagerplaceringsproblemet konsekvent kunde beräkna optimala lösningar. Den utökade modellen löstes bäst av den linjära heltalsoptimeringsimplementeringen, då denna implementering konsekvent resulterade i bäst (lägst) värde i målfunktion samt löste problemet med låg beräkningstid. Slutligen identifierades flertalet potentiella modellförbättringar som skulle kunna implementeras för att ge modellen mer generaliserbarhet. Detta skulle även innebära att modellen själv kan utvärdera hur många lager som bör byggas givet en satt budget. Således kan modellen även erbjuda mer strategiska beslut om dessa förbättringar implementeras. Ytterligare forskning skulle även kunna göras inom metaheuristik och maskininlärning för att ytterligare förbättra distansmodelleringen.
Alenezy, Eiman Jadaan Saleh Khalaf. "An investigation of models and solution algorithms for the capacitated facility location problem." Thesis, Brunel University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.436499.
Full textBalcik, Burcu. "Multi Item Integrated Location/inventory Problem." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/4/1093640/index.pdf.
Full textHsieh, Pei-Shan, and Pei-Shan Hsieh. "Investigating the Maximal Coverage by Point-based Surrogate Model for Spatial Facility Location Problem." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/623182.
Full textSilav, Ahmet. "Bi-objective Facility Location Problems In The Presence Of Partial Coverage." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/2/12610681/index.pdf.
Full textGuerrero, Rueda William Javier. "Models and optimization methods for the inventory-location-routing problem." Thesis, Troyes, 2014. http://www.theses.fr/2014TROY0002/document.
Full textThe problem of designing a supply chain including simultaneously routing and inventory management decisions is studied in this thesis. The objective is to select a subset of depots to open, the inventory policies for a 2-echelon system, and the set of routes to perform distribution from the upper echelon to the next using a homogeneous fleet of vehicles over a finite planning horizon. Demand is considered to be known. Applications are found in humanitarian logistics and military logistics. To solve the problem, two matheuristic procedures are developed. On the first part a cooperative algorithm combining exact methods for the supply chain design problem and routing heuristics is presented. On the second part, a partition is proposed using a Dantzig-Wolf reformulation on the routing variables. An hybridization between column generation, Lagrangian relaxation and local search is proposed in this part, put together as a heuristic method. Furthermore, results demonstrate the capability of the algorithms to compute high quality solutions and empirically estimate the improvement in the cost function of the proposed model when compared to a sequential optimization approach. Furthermore, results of the proposed methodologies on benchmark instances for subproblems are studied as well. Those are the capacitated location-routing problem, the inventory-routing problem, and the generalized elementary shortest path problem
Rahmani, Younes. "The Multi-product Location-Routing Problem with Pickup and Delivery." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331/document.
Full textIn the framework of Location-Routing Problem (LRP), the main idea is to combine strategic decisions related to the choice of processing centers with tactical and operational decisions related to the allocation of customers to selected processing centers and computing the associated routes. This thesis proposes a new location-routing model to solve problems which are coming from logistics networks, that became nowadays increasingly complex due to the need of resources sharing, in order to integrate the constraints of sustainable development and fuels price, which is increasing irreversibly. More precisely, three aspects have been integrated to generalize the classical LRP models already existed in the literature: 1) pickup and delivery aspect, 2) multi-product aspect, and 3) the possibility to use the processing centers as intermediate facilities in routes. We studied two logistics schemes gives us two new location-routing models: (i) MPLRP-PD (Multi-product LRP with pickup and delivery), which can be viewed as an extension of the vehicle routing problem with pick-up and delivery, including a tactical decision related to the location of processing centers (node with pick-up and delivery), and (ii) 2E-MPLRP-PD (Two-echelon multi-product LRP with pickup and delivery), which is a generalization of the two-echelon LRP. Both models were formalized by mixed integer linear programming (MIP). Solving techniques, based on heuristic methods, clustering approach and meta-heuristic techniques have been proposed to solve the MPLRP-PD and the 2E-MPLRP-PD. The benchmarks from the literature were generalized to test and to validate the proposed algorithms
Hasda, Ranjan Kumar. "Contribution to the optimization of Unequal Area Rectangular Facility Layout Problem." Thesis, Ecole centrale de Nantes, 2017. http://www.theses.fr/2017ECDN0026.
Full textA facility layout design is one of the most commonly faced problems in the manufacturing sectors. The problem is mixed-integer in nature and usually an NP-hard problem, which makes it difficult to solve using classical optimization techniques, which are better for local search. To overcome these limitations, two algorithms have been proposed for solving static facility layout problems with the unequal size compartments. The objective function of the problems considered is nonlinear in which the sum of the material handling cost has been minimized. In the first approach, a hybrid constructive and improvement model has been proposed where an advanced bottom-left fill technique was used as constructive approach. The constructive model proposed also acts as a local search method based on greedy algorithm. For improvement approach a hybrid genetic algorithm has been proposed, where the crossover and mutation operator are specially designed to handle the solution representation which itself is used as constructive model. In the second approach, a combined local and global search model was proposed where a rotation operator was used to avoid mixed-integer formulation of the problem. Use of rotation operator has also reduced the number of variables significantly. Apart from the conventional evolutionary operators this model has also used exchange and rotation operators. The performances of both model are tested over a previously solved problem selected from the literature. The evaluation of the results shows that the performances of the proposed models are better than many existing algorithms and has the potential for field applications
Lanz, Ernest John. "Decision support with respect to facility location and fleet composition for FoodBank Cape Town." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/79860.
Full textENGLISH ABSTRACT: FoodBank South Africa is an non-profit organisation formed to establish a national network of community foodbanks in urban and rural areas of South Africa, with all participants working towards the common goal of eliminating hunger and food insecurity. FoodBank Cape Town was the first of these community foodbanks launched in South Africa on 2 March 2009. The operations of FoodBank Cape Town include sourcing food and redistributing it to agencies (social services organisations running feeding programmes). Currently the majority of the food is sourced from the retail sector and then redistributed to approximately two hundred agencies. The logistics involved in both sourcing and distributing food are vital to the efficient functioning of FoodBank Cape Town. Since the costs associated with these logistics operations are very high, streamlining these operations has been identified as a priority area for efficiency improvement. The focus in this thesis is on the distribution logistics involved, specifically focussing on a facility location problem according to which FoodBank Cape Town can establish local distribution depots to which it delivers food and from which the agencies collect food assigned to them. A mixed-integer programming model is formulated for the above facility location problem and small test instances of the problem are solved using different exact and approximate solution methods in order to identify a suitable solution methodology for the full (large-scale) FoodBank Cape Town facility location problem. The full facility location problem is solved approximately by means of a meta-heuristic solution method in the more highly constrained instances, while an exact method is selected for solving the lesser constrained instances. The problem is first solved based on the distances between the warehouse and the depots as well as the distances between the agencies and the depots, for the twenty four instances where 17 to 40 depots are located. The model is then developed further to incorporate the cost of distribution. This cost-based facility location model is solved with a view to minimise the cost of food distribution from the warehouse to the depots and the cost of food distribution incurred by each agency to collect food from its assigned depot. A basic vehicle routing technique is applied to the cost-based facility location solution and the associated costs of the distribution are updated. This cost-based solution updating process is performed iteratively until the solution converges. Since the cost of food distribution depends on the vehicle fleet composition used, a vehicle fleet composition comparison of possible FoodBank Cape Town vehicles is performed to determine the most desirable vehicle fleet composition to be used for the distribution of food to depots. The results of the FoodBank Cape Town facility location problem and vehicle fleet composition comparison are presented and recommendations are made to FoodBank Cape Town regarding the preferred number of depots, the location of these depots and the preferred vehicle fleet composition.
AFRIKAANSE OPSOMMING: FoodBank South Africa is ’n nie-winsgewende organisasie wat ten doel het om ’n nasionale netwerk van gemeenskapsvoedselbanke in stedelike en landelike gebiede van Suid-Afrika op die been te bring, waarin al die deelnemers die gemeenskaplike doel nastreef om honger en voedselonsekerheid te elimineer. Foodbank Cape Town was die eerste van hierdie gemeenskapsvoedselbanke in Suid-Afrika en is op 2 Maart 2009 gestig. Die take van Foodbank Cape Town sluit in die versameling van voedsel en die verspreiding daarvan aan agentskappe (gemeenskapsorganisasies wat voedingsprogramme bestuur). Die oorgrote meerderheid voedsel is tans uit die kleinhandelsektor afkomstig en word aan ongeveer tweehonderd agentskappe versprei. Die logistiek wat met hierdie versamelings- en verspreidingsprosesse gepaard gaan, is sentraal tot die doeltreffende funksionering van FoodBank Cape Town. Aangesien die kostes verbonde aan hierdie logistieke prosesse baie hoog is, is hierdie aktiwiteite as ’n prioriteitsarea vir verbetering geidentifiseer. Die fokus in hierdie tesis val op die logistiek verbonde aan die verspreiding van voedsel deur FoodBank Cape Town, en meer spesifiek op die probleem van die plasing van ’n aantal lokale verspreidingsdepots waar FoodBank Cape Town voedsel kan aflewer en waar die agentskappe dan voedsel wat aan hulle toegeken is, kan gaan afhaal. ’n Gemengde heeltallige-programmeringsmodel word vir die bogenoemde plasingsprobleem geformuleer en klein gevalle van die model word deur middel van beide eksakte en benadere oplossingstegnieke opgelos om sodoende ’n geskikte oplossingsmetode vir die volle (grootskaalse) Food- Bank Cape Town plasingsmodel te identifiseer. Die volle plasingsmodel word aan die hand van ’n metaheuristiese oplossingstegniek benaderd opgelos vir hoogsbeperkte gevalle van die model, terwyl minder beperkte gevalle van die model eksak opgelos word. Die plasingsmodel word eers met die oog op die minimering van afstande tussen die pakhuis en verspreidingsdepots sowel as tussen die verspreidingsdepots en agentskappe vir die vier-en-twintig gevalle van die plasing van 17 tot 40 verspreidingsdepots opgelos. Die model word dan verder ontwikkel om ook die koste van die verspreiding van voedsel in ag te neem. Die koste-gebaseerde plasingsmodel word opgelos met die doel om die voedselbankkoste van voedselverspreiding vanaf die pakhuis na die lokale verspreidingsdepots sowel as die agentskapkoste van die afhaal van voedsel vanaf verspreidingsdepots te minimeer. ’n Basiese voertuigroeteringstegniek word op die koste-gebaseerde plasingsmodel toegepas en die verspreidingskoste word dienooreenkomstig aangepas. Hierdie aanpassingsproses van die koste-gebaseerde oplossing word herhaal totdat die oplossing konvergeer. Aangesien die koste van voedselverspreiding afhang van die voertuigvlootsamestelling, word ’n vergelyking tussen moontlike vlootsamestellings vir FoodBank Cape Town getref om die mees geskikte samestelling van voertuie vir die verspreiding van voedsel te vind. Die resultate van die FoodBank Cape Town verspreidingsdepot-plasingsprobleem en vlootsamestellingsvergelyking word aangebied en ’n aanbeveling word aan FoodBank Cape Town gemaak in terme van ’n geskikte aantal verspreidingsdepots, waar hierdie depots geleë behoort te wees, en ’n geskikte voertuigvlootsamestelling vir die verspreiding van voedsel.
Chraibi, Abdelahad. "A decision making system for operating theater design : application of facility layout problem." Thesis, Saint-Etienne, 2015. http://www.theses.fr/2015STET4017/document.
Full textIn the last decades, the important increasing consumption of health care and the growing of population make elimination of waste and continuous productivity improvement more and more critical for hospitals to provide their care services effectively and efficiently. The productivity and efficiency of a hospital depends on the caregivers working conditions, which are impacted greatly by the work place and the facilities organization [Dares (2013)]. Facilities planning “determines the physical organization of a production system and finding the most efficient arrangement of ‘n’ indivisible facilities in ‘n’ locations” [Singh & Sharma (2006)]. Thus, facilities planning has a great impact on the productivity and efficiency of running a hospital. Being aware of this need, the work we present aims to find a solution to facilities planning for the Operating Theater “the heart of hospital” by proposing an intelligent tool we make available to decision makers for optimizing their operating theater design. Our research work focuses on the use of operational research methods in order to find a solution for this optimization problem. Methods we explored for the realization of this work were variant, namely exact algorithm, heuristics, metaheuristics and intelligent methods, which allow us to compare different issues in order to provide the best solution to different scenarios of problems. Thus, in this dissertation we present the major contribution of our work, starting with the application of Mixed Integer Programming (MIP) to solve Operating Theater Layout Problem (OTLP) as the first scientific contribution. This work considers three different formulations (i.e. the multi-sections, the multi-floors and the multi-rows) in two different environment types (i.e. static and dynamic) while optimizing two different objective functions (i.e. to minimize the total traveling cost and to maximize the total adjacency rate). The combination of these different components gives rise to nine MIP models to solve the OTLP for which optimal solution was provided to problems with until forty facilities. These contributions are presented in the third and fourth chapters. The use of Multi-Agent System (MAS) to solve Facility Layout Problem (FLP) is the second scientific contribution we present in chapter five. In literature, only one work [Tarkesh et al., (2009)] applied the MAS to solve small sized problems, which makes our work the first one adopting MAS to address both the static and dynamic FLP for large sized problems using a novel algorithm running in three steps to solve OTLP. The developed multi-agent platform exploit the three different agents’ protocols of communication, namely coordination, cooperation and negotiation to conceive different agents’ architectures to deal with the static and dynamic OTLP. The last contribution consisting on the use of Particle Swarm Optimization (PSO) under continuous layout representation to solve multi-rows FLP is presented in chapter six. Since the PSO is generally used to solve assignment problems or discrete FLP, the actual formulation is among the few works dealing with the continuous one. This leads us to conceive a novel encoding technique and the appropriate heuristics to generate initial solutions and to perform the local search procedure. Another novelty is related to the application of PSO to a multi-rows layout problem, which was not addressed before. To the best of our knowledge, PSO works usually formulate the FLP as a single row or in the best of scenarios, as a double-rows problem
Rahmani, Younes. "The Multi-product Location-Routing Problem with Pickup and Delivery." Electronic Thesis or Diss., Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331.
Full textIn the framework of Location-Routing Problem (LRP), the main idea is to combine strategic decisions related to the choice of processing centers with tactical and operational decisions related to the allocation of customers to selected processing centers and computing the associated routes. This thesis proposes a new location-routing model to solve problems which are coming from logistics networks, that became nowadays increasingly complex due to the need of resources sharing, in order to integrate the constraints of sustainable development and fuels price, which is increasing irreversibly. More precisely, three aspects have been integrated to generalize the classical LRP models already existed in the literature: 1) pickup and delivery aspect, 2) multi-product aspect, and 3) the possibility to use the processing centers as intermediate facilities in routes. We studied two logistics schemes gives us two new location-routing models: (i) MPLRP-PD (Multi-product LRP with pickup and delivery), which can be viewed as an extension of the vehicle routing problem with pick-up and delivery, including a tactical decision related to the location of processing centers (node with pick-up and delivery), and (ii) 2E-MPLRP-PD (Two-echelon multi-product LRP with pickup and delivery), which is a generalization of the two-echelon LRP. Both models were formalized by mixed integer linear programming (MIP). Solving techniques, based on heuristic methods, clustering approach and meta-heuristic techniques have been proposed to solve the MPLRP-PD and the 2E-MPLRP-PD. The benchmarks from the literature were generalized to test and to validate the proposed algorithms
Bainton, David John. "Optimisation of a complex multi-facility resource scheduling problem : the application of the discrete activity-orientated simulation method to project management." Thesis, Cardiff University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283529.
Full textMangotra, Divya. "Integrated Decisions for Supply Chain Design and Inventory Allocation Problem." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19814.
Full textMenth, Megan. "An agent-based modeling approach to assess coordination among humanitarian relief providers." Thesis, Kansas State University, 2016. http://hdl.handle.net/2097/32589.
Full textDepartment of Industrial & Manufacturing Systems Engineering
Jessica L. Heier Stamm
Coordination between humanitarian organizations is critical during the response effort to a disaster, as coordinating aid improves efficiency, reduces duplication of efforts, and ultimately leads to better outcomes for beneficiaries. One particular challenge arises when temporary facilities must be established post-disaster due to the destruction of buildings. For example, the 2015 Nepal earthquakes created a need for the placement of over 4,000 temporary learning facilities after several school buildings were damaged or destroyed. It is important that humanitarians coordinate well to fill these needs efficiently and effectively, while maintaining equity among beneficiaries in the affected areas. This means ensuring that enough facilities are provided in a timely manner, and are distributed fairly to all in need. The goals of this thesis are to study coordination strategies focusing primarily on the placement of temporary educational facilities for children following a disaster. This research also aims to gather useful data by surveying active humanitarians in order to better understand their decisions made in the field. This work uses the results of this survey, along with publicly available data published after the 2015 Nepal earthquakes to create an agent-based simulation model, and uses the Nepal case study to demonstrate the efficacy of the model framework. This research finds that organizations' initial location of operation can greatly impact the number of facilities they are collectively able to establish, the geographic disparity across the region, and the organizations' utilization. Specifically, while focusing efforts on the districts with the most need is most efficient and effective, a more uniform approach yields a more equitable response. This work also finds that there can be a trade-off between overall effectiveness and the number of partnerships established in the field. These findings show a need for further study into the intricacies of coordination between humanitarian workers. This author advocates for the use of information sharing mechanisms among practitioners, as well as further utilization of agent-based modeling as a means of studying the complex nature of disaster response. Specifically there is a need to further study educational needs as a logistical problem, and strategies for solving the post-disaster facility location problem.
Rodríguez-Espíndola, Oscar. "A multi-organisational approach for disaster preparedness and response : the use of optimisation and GIS for facility location, stock pre-positioning, resource allocation and relief distribution." Thesis, Aston University, 2016. http://publications.aston.ac.uk/28898/.
Full textAn, Yu. "Reliable Design and Operations of Infrastructure Systems." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5345.
Full textPeng, Zhihao. "Optimisation par essaims particulaires pour la logistique urbaine." Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCA010/document.
Full textIn this thesis, we are interested in the management of goods flows in urban areas, also called last mile logistics, and associated with various current issues: economic, environmental, and societal. Four main stakeholders are involved by these challenges: shippers, customers, carriers and local authorities, each with different priorities (improving service quality, minimizing the travelling distance, reducing greenhouse gas emissions, etc.). Faced with these challenges in the city, one possible action lever is to optimize the routes for the pickup and/or delivery of goods. Three types of urban flows are considered: from or to the city, and intra-urban. For outgoing and incoming flows into the city, the goods are first grouped in a warehouse located on the suburban area of the city. If there are several warehouses, the associated planning problem is the Location Routing Problem (LRP). We are studying one of its variants called the Capacitated Location Routing Problem (CLRP). In this problem, by respecting the capacity constraint on vehicles and depots, the location of depots and route planning are considered at the same time. The objective is to minimize the total cost, which consists of the cost of opening depots, the cost of using vehicles, and the cost of the travelling distance. For all flows, we are also looking to solve a Pickup and Delivery Problem (PDP), in which a fleet of vehicles simultaneously carries out pickup and delivery operations. We focus on two of its variants: the selective variant where not all requests are satisfied, in a context of paired demands and time windows on sites (Selective Pickup and Delivery Problem with Time Windows and Paired Demands, or SPDPTWPD). The second studied variant is the extension of the first one by adding the possibility of carrying out transport in several stages by introducing operations for the exchange of goods between vehicles at transfer sites (Selective Pickup and Delivery with Transfers or SPDPT). The considered objectives for these two variants of PDP are to maximize profit and to minimize distance. Each studied problem is formally described, mathematically modelled as a linear program and then solved by exact, heuristic and/or metaheuristic methods. In particular, we have developed algorithms based on a metaheuristic called Particle Swarm Optimization, which we have hybridized with local search operators. The approaches are validated on instances of different sizes from the literature and/or on instances that we have generated. The results are critically analyzed to highlight the advantages and drawbacks of each method
Posta, Marius. "« Resolution Search » et problèmes d’optimisation discrète." Thèse, Avignon, 2012. http://hdl.handle.net/1866/8393.
Full textThe combinatorial nature of discrete optimization problems often makes them diffi- cult to solve. Consider for instance integer linear programming problems, which are commonly solved using a Branch-and-Bound approach. An alternative approach, Resolution Search, was proposed by Chvátal in 1997 for solving 0-1 optimization problems, but remains little known to this day and as such has seen few practical applications. This thesis attempts to remedy this state of affairs, with partial success. Its first contribution consists in the generalization of Resolution Search to any discrete optimization problem, while introducing new definitions and concepts. Next, we tried to validate this approach by attempting to solve well-known problems efficiently with it. Although our research did not succeed in this respect, it lead us to new methods for solving the generalized assignment and uncapacitated facility location problems. After presenting these methods, this thesis concludes with a summary of our attempts at practical application of Resolution Search, along with further perspectives on this matter.
Thèse réalisée en cotutelle avec l'Université d'Avignon.
Khan, Mohd Rifat. "Designing Cost Effective and Flexible Vinyl Windows Supply Chain: Assembly Line Design Using CM/SERU Concepts and Simultaneous Selection of Facilities and Suppliers." Ohio University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501863274303785.
Full textDkhil, Hamdi. "Optimisation des systèmes de stockage de conteneurs dans les terminaux maritimes automatisés." Thesis, Le Havre, 2015. http://www.theses.fr/2015LEHA0011/document.
Full textAIn our study, we consider two optimization problems in automated container terminals at import; the first is the vehicle scheduling problem; and the second is the integrated problem of location assignment and vehicle scheduling. In the first part of our study, we propose different traffic layout adapted to the two studied problems and to every kind of automated container terminal. We also introduce relevant reviews of literature treating the optimization of container handling systems at maritime terminal, the optimization of general automated guided vehicle system and the multi-objective optimization in general, and in particular context of maritime container terminals. In the second part, we resolve the planning of QC-AV-ASC (Quay Cranes-Automated Vehicles - Automated Stacking Cranes). We present an effective model for every kind of traffic layout. Moreover, we propose an efficient bi-objective model which is important to determine the optimal storage time and the minimal number of required AVs. CPLEX resolutions are used to prove the efficiency of our modelling approach. In the third part of this thesis, we explore a problem which has not been sufficiently studied: the integrated problem of location assignment and vehicle scheduling (IPLAVS), in Maritime Automated Container Terminal (MACT) at import. This part represents a new and realistic approach of MACT optimization considering mono-objective and multi-objective aspect
Dias, FÃbio Carlos Sousa. "Algoritmos para o problema de localizaÃÃo simples baseados nas formulaÃÃes clÃssica e canÃnica." Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2827.
Full textNeste trabalho, estudamos o problema de localizaÃÃo simples (SPLP - Simple Plant Location Problem). Usando a formulaÃÃo matemÃtica clÃssica e uma outra formulaÃÃo proposta recentemente, desenvolvemos vÃrios algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulaÃÃo clÃssica, tais limites sÃo obtidos utilizando o mÃtodo de correÃÃo de dados e critÃrios de dominÃncia entre os custos xos e de transporte. Propomos uma projeÃÃo dessa formulaÃÃo, que se mostrou computacionalmente atrativa. Usando a nova formulaÃÃo propomos e mostramos a corretude de vÃrios procedimentos iterativos que procuram encontrar uma soluÃÃo para o problema, resolvendo uma seqÃÃncia de subproblemas paramÃtricos obtidos com a remoÃÃo de variÃveis e restriÃÃes da formulaÃÃo original. Em cada iteraÃÃo desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxaÃÃo lagrangeana a essa nova formulaÃÃo para obter outros limites. Analisamos vÃrias possibilidades de relaxaÃÃo das restriÃÃes. Desenvolmento tambÃm algoritmos branch-and-bound baseados em ambas as formulaÃÃes e nos limites obtidos. Avaliamos a e ciÃncia computacional de todos os algoritmos com instÃncias de teste difÃceis, disponÃveis na literatura. Resultados computacionais e comparaÃÃes com outros algoritmos da literatura sÃo reportados.
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Dias, Fábio Carlos Sousa. "Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica." reponame:Repositório Institucional da UFC, 2008. http://www.repositorio.ufc.br/handle/riufc/17871.
Full textSubmitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:13:52Z No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:16:23Z (GMT) No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Made available in DSpace on 2016-06-22T17:16:23Z (GMT). No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5) Previous issue date: 2008
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to …nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between …xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to …nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e¢ ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Neste trabalho, estudamos o problema de localização simples (SPLP - Simple Plant Location Problem). Usando a formulação matemática clássica e uma outra formulação proposta recentemente, desenvolvemos vários algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulação clássica, tais limites são obtidos utilizando o método de correção de dados e critérios de dominância entre os custos …xos e de transporte. Propomos uma projeção dessa formulação, que se mostrou computacionalmente atrativa. Usando a nova formulação propomos e mostramos a corretude de vários procedimentos iterativos que procuram encontrar uma solução para o problema, resolvendo uma seqüência de subproblemas paramétricos obtidos com a remoção de variáveis e restrições da formulação original. Em cada iteração desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxação lagrangeana a essa nova formulação para obter outros limites. Analisamos várias possibilidades de relaxação das restrições. Desenvolmento também algoritmos branch-and-bound baseados em ambas as formulações e nos limites obtidos. Avaliamos a e…ciência computacional de todos os algoritmos com instâncias de teste difíceis, disponíveis na literatura. Resultados computacionais e comparações com outros algoritmos da literatura são reportados.
Ndhaief, Nadia. "Problème d'implantation de plateformes de logistiques durables en milieu urbain." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0044/document.
Full textThe urban environment is strongly involved in the management of logistics flows. The pooling of these different flows provides a qualitative solution ensuring environmental, economic and societal criteria. The thesis objectives aim at supporting Urban Distribution Centers (CDU) by combining distribution logistics with reverse logistics (upstream flows and downstream flows), thereby ensuring sustainable development in modern cities. The heterogeneity of the distribution logistics practices and the reverse logistics define the core of this thesis. Sharing these different flows provides a qualitative and sustainable solution as long as it meets the aforementioned criteria (environment, economy and society). Our approach is based on the Hub Location Problem to formulate the location problem of UDC while maximizing the profit and choosing the best available location. We proceed by identifying potential available locations, while guaranteeing returned flows management (collection, sorting, resale, etc.) and reducing pollution impact. Moreover, we simulate our optimised model with simulation tools using optimization algorithms. The effectiveness of these algorithms are validated based on generated outputs (set of data) inspired by real world scenarios. Reliability is a part of this work when dealing with UDC deployment. The unavailability of the system may be due to random failures, planned preventive maintenance actions, etc. Therefore, we present a solution supporting daily demands by integrating a collaborative approach between different sites. This approach is based on inter-CDU coordination policy with a strategy of subcontracting deliveries dealing with unavailability
Rezaei, Hamidreza. "Designing a supply chain network integrating financial dimensions." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2022. http://www.theses.fr/2022IMTA0302.
Full textThis thesis focuses on the development of a mathematical model and optimization algorithms for the design of a supply chain integrating financial dimensions. We propose a capacitated, multi-period, single-echelon, single-product model. The objective function to be maximized is the firm's value, represented by its Adjusted Present Value (APV). The decision binary variables are related to the location of logistics facilities; the continuous variables concern product flows and debt planning. The mathematical model is first evaluated by solving a set of generated instances using a state-of-the-art solver. We propose a sequential approach, consisting in optimizing the logistic variables first, then the financial variables. Then, we propose an optimization procedure based on the Large Neighborhood Search (LNS) metaheuristic to solve larger instances. Finally, consider the logistic and financial dimensions as two independent objectives. The multi-directional local search (MDLS) is employed to solve the bi-objective model by embedding the LNS into that framework. Extensive numerical experiments assess the relevance of our model and compare the performance of our algorithms to those of the solver
Eskandarpour, Majid. "Generic models and optimization algorithms for sustainable supply chain network design." Thesis, Nantes, Ecole des Mines, 2014. http://www.theses.fr/2014EMNA0195/document.
Full textThis thesis focuses on the development of mathematical models and optimization algorithms for the design of sustainable supply chains. We propose single-period, multi-commodity, multi-mode, four level models (suppliers, production facilities, warehouses and customers) covering economic and environmental pillars of sustainable development. The decision variables are related to the location of the intermediate logistics sites (production units and warehouses), the choice of technology and mode of transport, and the determination of product flow. A first model is based solely on minimizing total costs. This model is extended to bi-objective minimization by considering CO2 emissions. We propose an optimization procedure based on the Large Neighborhood Search (LNS) metaheuristic, which had almost never been applied to problems with mixed variables such as design supply chain. Our extension to the bi-objective case involves the use of the multi-directional local search (MDLS). Extensive numerical experiments assess the relevance of our model and compare the performance of our algorithms to those of a state-of-the-art solver
Chen, Linjie. "Approche générique pour la prise de décisions multi-niveaux, contribution à la gestion des systèmes de production de soins en réseau." Thesis, Saint-Etienne, 2015. http://www.theses.fr/2015STET4006/document.
Full textFrench healthcare system confronts the challenges of permanent increase in demand for healthcare, under heavy financial pressure. In the national healthcare strategy, a key focus is to develop a cooperation framework involving all organizations and units. These challenges require healthcare engineering to find efficiency in a more global scale, which means to integrate local optimization problems and decision tools that have generally a high degree of fragmentation in order to contribute to the overall improvement of the system. In this thesis, initiated by a shared unit-dose drug distribution system design project, a generic method was developed to solve the multi-level optimization problem in which interdependent decisions are made at different levels in a hierarchical structure, or at successive stages. The decisions made are often correlated, particularly for decisions in hierarchical topologies that we define by the term "optimal substructure with feedback". The resolution of this problem must be adapted to take into account all implications for correlated decisions. The proposed method is based on the meta-heuristic PSO, it uses a recursive procedure to define the top-down transfer of parameters and the bottom-up feedback of fitness through multiple search spaces, and ensures the consistency of global problem convergence. Our applications and analyzes have shown that this method is generic and is able to provide similar resolution performance and quality compared to the literature references
Ndhaief, Nadia. "Problème d'implantation de plateformes de logistiques durables en milieu urbain." Electronic Thesis or Diss., Université de Lorraine, 2018. http://www.theses.fr/2018LORR0044.
Full textThe urban environment is strongly involved in the management of logistics flows. The pooling of these different flows provides a qualitative solution ensuring environmental, economic and societal criteria. The thesis objectives aim at supporting Urban Distribution Centers (CDU) by combining distribution logistics with reverse logistics (upstream flows and downstream flows), thereby ensuring sustainable development in modern cities. The heterogeneity of the distribution logistics practices and the reverse logistics define the core of this thesis. Sharing these different flows provides a qualitative and sustainable solution as long as it meets the aforementioned criteria (environment, economy and society). Our approach is based on the Hub Location Problem to formulate the location problem of UDC while maximizing the profit and choosing the best available location. We proceed by identifying potential available locations, while guaranteeing returned flows management (collection, sorting, resale, etc.) and reducing pollution impact. Moreover, we simulate our optimised model with simulation tools using optimization algorithms. The effectiveness of these algorithms are validated based on generated outputs (set of data) inspired by real world scenarios. Reliability is a part of this work when dealing with UDC deployment. The unavailability of the system may be due to random failures, planned preventive maintenance actions, etc. Therefore, we present a solution supporting daily demands by integrating a collaborative approach between different sites. This approach is based on inter-CDU coordination policy with a strategy of subcontracting deliveries dealing with unavailability
Tran, Khanh Toan. "Déploiement efficace de services complexes dans l'infrastructure de cloud." Phd thesis, Université d'Evry-Val d'Essonne, 2013. http://tel.archives-ouvertes.fr/tel-00875818.
Full textCarrara, Camilla Miguel. "Uma aplicação do SIG para a localização e alocação de terminais logísticos em áreas urbanas congestionadas." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/18/18144/tde-07022008-111929/.
Full textThe present work starting from the characterization of transport problem in the Uberlândia (MG) central area , and with the use of tools of the software TransCAD (SIG-T), as facility location problem and vehicle routing, it was looked for to propose an alternative to contribute to the urban goods distribution, mainly in the urban central areas, with focus in the minimization of the transport costs and considering the brazilian reality and the current discussions on alternatives of operational and technological innovations. The chosen method for the study of case based on the data of the urban road net and goods movement in the central area of the city, in way to guide modern and more effective strategies for physical products distribution and to provide better conditions in the flow in these areas. The method still leaned on in the definition and characterization of the concept of logistics urban and logistics terminals, and the influence that they would exercise in the urban goods distribution, mainly in the central areas, of the Uberlândia city. The software was shown a support tool to decisions in the urban planning. The use of the software TransCAD can be validated in the search by great solutions for the logistics terminals and in the vehicle routing that compose the fleet of the terminals, like this, it is believed that is a tool for logistics operations. Even with some limitations of the software, this contributes so that we arrived to the final results reaching the objectives initials proposed.
Lian, Lian. "A hierarchical and structured methodology to solve a general delivery problem : resolution of the basic sub-problems in the operational phase." Phd thesis, Ecole Centrale de Lille, 2010. http://tel.archives-ouvertes.fr/tel-00586083.
Full textDanach, Kassem. "Hyperheuristiques pour des problèmes d’optimisation en logistique." Thesis, Ecole centrale de Lille, 2016. http://www.theses.fr/2016ECLI0025/document.
Full textSuccess in using exact methods for large scale combinatorial optimization is still limited to certain problems or to specific classes of instances of problems. The alternative way is either using metaheuristics or matheuristics that rely on exact methods in some ways. In the context of combinatorial optimization, we are interested in heuristics to choose heuristics invoked to solve the addressed problem. In this thesis, we focus on hyperheuristic optimization in logistic problems. We focus on proposing a hyperheuristic framework that carries out a search in the space of heuristic algorithms and learns how to change the incumbent heuristic in a systematic way along the process in such a way that a good sequence of heuristics produces high quality solutions. We propose HHs for two problems in logistics: the workover rig scheduling problem and the hub location routing problem. Then, we compare the performances of several HHs described in the literature for the latter problem, which embed different heuristic selection methods such as a random selection, a choice function, a Q-Learning approach, and an ant colony based algorithm. The computational results prove the efficiency of HHs for the two problems in hand, and the relevance of including Lagrangian relaxation information for the second problem
Haddad, Marcel Adonis. "Nouveaux modèles robustes et probabilistes pour la localisation d'abris dans un contexte de feux de forêt." Electronic Thesis or Diss., Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLD021.
Full textThe location of shelters in different areas threatened by wildfires is one of the possible ways to reduce fatalities in acontext of an increasing number of catastrophic and severe forest fires. The problem is basically to locate p sheltersminimizing the maximum distance people will have to cover to reach the closest accessible shelter in case of fire. Thelandscape is divided in zones and is modeled as an edge-weighted graph with vertices corresponding to zones andedges corresponding to direct connections between two adjacent zones. Each scenario corresponds to a fire outbreak ona single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways. First, an evacuationpath cannot pass through the vertex on fire. Second, the fact that someone close to the fire may have limited choice, ormay not take rational decisions, when selecting a direction to escape is modeled using a new kind of evacuation strategy.This evacuation strategy, called Under Pressure, induces particular evacuation distances which render our model specific.We propose two problems with this model: the Robust p-Center Under Pressure problem and the Probabilistic p-CenterUnder Pressure problem. First we prove hardness results for both problems on relevant classes of graphs for our context.In addition, we propose polynomial exact algorithms on simple classes of graphs and we develop mathematical algorithmsbased on integer linear programming
(7407275), Todd Zhen. "Optimal Sensor Placement Problems Under Uncertainty: Models and Applications." Thesis, 2019.
Find full textchen, mei-ling, and 陳美玲. "Multiple Objective Competitive Facility Location Problem." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/83738222746155137648.
Full text國立中央大學
土木工程學系
86
The newly developed field of competitive facility location problem has been a booming issue. The field focuses on how private sectors select their facility locations, also tries to explain the competitive strategic relations between new-coming companies and existing companies. The result of different companies' decision might lead to profound interactions between companies. The newly developed method differs a lot from traditional decision-making which only pay attentions to the demands of themselves. In the past, companies decided the location with only the experience they had before without being able to predict the future. If a theoretical analysis could be taken as the basis of locating, along with factors of economy, land, society and law all taken into consideration, the choice of location will be more successful and beneficial for the company. As the environment we are facing is an uncertain and blurred one, lots of decisions were made without clear goal, limitation, alternatives, even the result itself is not very clear. So the fuzzy theory could be taken as a tool to analyze these complicated phenomena, and the realistic problems could be explained and solved in a more reasonable way.
Hu, Cheng-hong, and 胡正宏. "The Capacitated Dynamic Facility Location Problem." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/20828118810425473748.
Full text國立高雄第一科技大學
運輸倉儲營運所
91
Responding to rapid change of the environment and market demand, every business must periodically review whether the existent facilities are able to meet its customers’ demand. It not only spends a lot of money but also takes time to setup a facility network. Also, the facilities will not be easily relocated in a short time when they are constructed. Besides, the choices of locations have significant influence on the transportation cost and time. Hence, better choice of locations will become the competitive advantage for a business. Only existent demand, construction cost, and transportation cost are considered in a traditional facility location problem (FLP). However, customers’ demand will vary with time periods. Also, businesses often use leasing to save huge construction cost in practice. These two factors are considered in the research. Since FLP is a NP-Hard problem, heuristic approach using TABU search algorithm was adopted. The algorithm was combined with ADD and DROP subroutines to find better solution. Sensitivity analysis for cost parameters was also carried out. The result showed that leasing would become an inferior choice when the ratio of leasing to construction cost is higher. In addition, the number of constructed facilities becomes smaller when transportation cost takes less influence on total cost.
Lin, Ping Ting, and 林娉婷. "The Multi-service Facility Location Problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/73412474625848008988.
Full text國立清華大學
工業工程與工程管理學系
103
We propose a generalization of the well-known facility location problem, called the multi-service facility location problem. In this problem, each facility has the ability to provide at most p kinds of distinct services, and each client has different requirements from the p kinds of services. The objective is to select a subset of facilities and to identify its corresponding service assignment to clients such that the requirements of each client can be satisfied, and the total cost, including the facility setup cost, service cost and connection cost is minimized. To solve this problem, we modify a local search heuristic algorithm, and present an approximation algorithm with theoretical analysis. In this study, we prove that our algorithm has a locality gap of 3 for this problem. We also implement the algorithm and the experimental result demonstrates its efficiency and effectiveness.
LIN, Chien-Feng, and 林建豐. "Military Fuel Distribution Center Facility Location Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/70411252524757232592.
Full text國立高雄第一科技大學
運籌管理所
97
This study addresses the facility location problem for the military fuel distribution centers. The fuel distribution task is one of the most important issues in the military logistics. However, the objectives and considerations for the fuel distribution center location are different for peacetime and wartime. The objective of the fuel distribution centers during peacetime is to minimize the total transportation costs. Nevertheless, the objective of the fuel distribution centers during wartime or war preparedness is to minimize the maximum travel times or travel distances to the served demands to reduce the exposure in the dangerous environment. Two models are proposed to address these two different problems. The sensitivity analysis is also performed to provide some insights for different situations and strategies.
TEDDY and 倪琨珉. "Efficient Heuristics For Facility Location Problem With Foresight." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/5qfu9w.
Full text國立臺北科技大學
管理國際學生碩士專班 (IMBA)
102
Researchers have been solving location problems with the assumption that the competition in the market does not subject the new facilities that is located in the market. Meanwhile, competitive facility location model is the awareness that a firm’s location may affect its market share. The facilities capture as many customers as possible in order to maximize the market share. On the other hand, no existing facilities exist in the area where p-center problems apply. The objective in p-center is to minimize the cost for customer. The consideration in this research is customers patronize the nearest facility, whereas distance is the attractiveness. Therefore, we could propose an idea to implement the p-center into competitive location problem model in order to satisfy the assumption. Tabu search is one algorithm that has been applied to location problems successfully. In addition to the contributions mentioned earlier, we could also utilize efficient heuristics for facility location with foresight.