Dissertationen: „Facility Location Optimisation Problem“

1

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/.

Der volle Inhalt der Quelle

Annotation:

This thesis is a critical investigation into the development, application and evaluation of ant colony optimisation metaheuristics, with a view to solving a class of capacitated facility location problems. The study is comprised of three phases. The first sets the scene and motivation for research, which includes; key concepts of ant colony optimisation, a review of published academic materials and a research philosophy which provides a justification for a deductive empirical mode of study. This phase reveals that published results for existing facility location metaheuristics are often ambiguous or incomplete and there is no clear evidence of a dominant method. This clearly represents a gap in the current knowledge base and provides a rationale for a study that will contribute to existing knowledge, by determining if ant colony optimisation is a suitable solution technique for solving capacitated facility location problems. The second phase is concerned with the research, development and application of a variety of ant colony optimisation algorithms. Solution methods presented include combinations of approximate and exact techniques. The study identifies a previously untried ant hybrid scheme, which incorporates an exact method within it, as the most promising of techniques that were tested. Also a novel local search initialisation which relies on memory is presented. These hybridisations successfully solve all of the capacitated facility location test problems available in the OR-Library. The third phase of this study conducts an extensive series of run-time analyses, to determine the prowess of the derived ant colony optimisation algorithms against a contemporary cross-entropy technique. This type of analysis for measuring metaheuristic performance for the capacitated facility location problem is not evident within published materials. Analyses of empirical run-time distributions reveal that ant colony optimisation is superior to its contemporary opponent. All three phases of this thesis provide their own individual contributions to existing knowledge bases: the production of a series of run-time distributions will be a valuable resource for future researchers; results demonstrate that hybridisation of metaheuristics with exact solution methods is an area not to be ignored; the hybrid methods employed in this study ten years ago would have been impractical or infeasible; ant colony optimisation is shown to be a very flexible metaheuristic that can easily be adapted to solving mixed integer problems using hybridisation techniques.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Durá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.

Der volle Inhalt der Quelle

Annotation:

Cette thèse porte sur la solution exacte des problèmes NP-difficiles du p-median et du p-centre, des problèmes d'optimisation combinatoire qui deviennent rapidement difficiles à résoudre lorsque la taille de l'instance augmente. Ces problèmes de localisation discrète consistent à ouvrir un nombre défini p d'installations, puis à leur affecter un ensemble de clients selon une fonction objectif à minimiser.Tout d'abord, nous étudions le problème du p-median qui cherche à minimiser la somme des distances entre les clients et les installations ouvertes auxquelles ils sont affectés. Nous développons un algorithme basé sur la décomposition de Benders qui surpasse les méthodes exactes de l'état de l'art. L'algorithme considère une approche en deux étapes et ainsi qu'un algorithme efficace pour la séparation des coupes de Benders. Cette méthode est évaluée sur plus de 230 instances de benchmark avec jusqu'à 238025 clients et sites. De nombreuses instances sont résolues à l'optimalité pour la première fois ou ont leur meilleure solution connue améliorée.Deuxièmement, nous explorons le problème du p-centre qui cherche à minimiser la plus grande distance entre un client et l'installation ouverte qui en est la plus proche. Nous comparons d'abord les cinq principales formulations MILP de la littérature. Nous étudions la décomposition de Benders et nous proposons également un algorithme exact basé sur une procédure de partionnement des clients reposant sur la structure du problème. Toutes les méthodes proposées sont comparées à l'état de l'art dans des instances de benchmark. Les résultats obtenus sont analysés, mettant en évidence les avantages et les inconvénients de chaque méthode.Enfin, nous étudions un problème robuste du p-centre en deux étapes avec une incertitude sur les demandes et les distances des nœuds. Nous introduisons la reformulation robuste du problème basée sur les cinq principales formulations déterministes MILP de la littérature. Nous prouvons que seul un sous-ensemble fini de scénarios de l'ensemble d'incertitude infini peut être pris en compte sans perdre l'optimalité. Nous proposons également un algorithme de génération de colonnes et de contraintes et ainsi qu'un algorithme de branch-and-cut pour résoudre efficacement ce problème. Nous montrons comment ces algorithmes peuvent également être adaptés pour résoudre le problème robuste d'une seule étape. Les différentes formulations proposées sont testées sur des instances générées aléatoirement et sur un cas d'étude de la littérature
This 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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.

Der volle Inhalt der Quelle

Annotation:

In today’s extremely competitive marketplace, firms are facing the need to meet or exceed increasing customer expectations while cutting costs to stay competitive in a global market. To develop competitive advantage in this business climate, companies must make informed decisions regarding their supply chain. In recent years, supply chain networks have received increasing attention among companies. The decision makers confront the network design problem in different situations. In order to make decisions, especially in strategic supply chain management, decision makers must have a holistic view of all the components. Supply chain network design, particular facility location problems, is one of the most complex strategic decision problems in supply chain management The aim of this dissertation is to make an inquiry about the facility location problems and related issues in supply chain and logistics management, and the use of modelling approaches to solve these problems. The methodology is to construct a review protocol by forming a review panel, and developing a detailed search strategy with clear inclusion and exclusion criteria. In addition, the measurement for evaluating the quality of studies is presented with a strategy for extracting data and synthesising the methodologies. The search results show the background of the facility location problems, the importance and the basic questions of these problems. The taxonomy of facility location problems with eighteen factors is presented. The basic static and deterministic problems in facility location including the covering, centre, median and fixed charge problems are discussed. Also, the extension of facility location problems comprises of location-allocation, multi-objective, hierarchical, hub, undesirable and competitive problems. In terms of uncertainty, dynamic, stochastic and robust facility location problems are presented. Finally, strengths and weaknesses of different modelling approaches are discussed; importantly, gaps from the review process are indentified. Recommendations of future research are described; and the facility location problem to be addressed by the proposed research is shown. In addition, contributions of the proposed facility location problem are illustrated.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Thangavelu, Balajee. „Single-Facility location problem among two-dimensional existing facility locations“. Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1175283985.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Wang, Yu Carleton University Dissertation Mathematics and Statistics. „The P-median problem and the uncapacitated facility location problem“. Ottawa, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Kotian, Siddharth R. „PLANAR k-CENTRA SINGLE-FACILITY EUCLIDEAN LOCATION PROBLEM“. Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1132796955.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Romero, Montoya Alejandro. „Resilient Facility Location Problem for Supply Chain Design“. Ohio University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou152631292582812.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Oyewole, Gbeminiyi John. „A Study on Integrated Transportation and Facility Location Problem“. Thesis, University of Pretoria, 2019. http://hdl.handle.net/2263/72419.

Der volle Inhalt der Quelle

Annotation:

The focus of this thesis is the development and solution of problems that simultaneously involve the planning of the location of facilities and transportation decisions from such facilities to consumers. This has been termed integrated distribution planning problems with practical application in logistics and manufacturing. In this integration, different planning horizons of short, medium and long terms are involved with the possibility of reaching sub-optimal decisions being likely when the planning horizons are considered separately. Two categories of problems were considered under the integrated distribution models. The first is referred to as the Step-Fixed Charge Location and Transportation Problem (SFCLTP). The second is termed the Fixed Charge Solid Location and Transportation Problem (FCSLTP). In these models, the facility location problem is considered to be a strategic or long term decision. The short to medium-term decisions considered are the Step-Fixed Charge Transportation Problem (SFCTP) and the Fixed Charge Solid Transportation Problem (FCSTP). Both SFCTP and FCSTP are different extensions to the classical transportation problem, requiring a trade-off between fixed and variable costs along the transportation routes to minimize total transportation costs. Linearization and subsequent local improvement search techniques were developed to solve the SFCLTP. The first search technique involved the development of a hands-on solution including a numerical example. In this solution technique, linearization was employed as the primal solution, following which structured perturbation logic was developed to improve on the initial solution. The second search technique proposed also utilized the linearization principle as a base solution in addition to some heuristics to construct transportation problems. The resulting transportation problems were solved to arrive at a competitive solution as regards effectiveness (solution value) compared to those obtainable from standard solvers such as CPLEX. The FCSLTP is formulated and solved using the CPLEX commercial optimization suite. A Lagrange Relaxation Heuristic (LRH) and a Hybrid Genetic Algorithm (GA) solution of the FCSLTP are presented as alternative solutions. Comparative studies between the FCSTP and the FCSLTP formulation are also presented. The LRH is demonstrated with a numerical example and also extended to hopefully generate improved upper bounds. The CPLEX solution generated better lower bounds and upper bound when compared with the extended LRH. However, it was observed that as problem size increased, the solution time of CPLEX increased exponentially. The FCSTP was recommended as a possible starting solution for solving the FCSLTP. This is due to a lower solution time and its feasible solution generation illustrated through experimentation. The Hybrid Genetic Algorithm (HGA) developed integrates cost relaxation, greedy heuristic and a modified stepping stone method into the GA framework to further explore the solution search space. Comparative studies were also conducted to test the performance of the HGA solution with the classical Lagrange heuristics developed and CPLEX. Results obtained suggests that the performance of HGA is competitive with that obtainable from a commercial solver such as CPLEX.
Thesis (PhD)--University of Pretoria, 2019.
Industrial and Systems Engineering
PhD
Unrestricted

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

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.

Der volle Inhalt der Quelle

Annotation:

The main purpose of this work is to present the basics and history of the metric uncapacitated facility location problem and give an introduction to the approximation algorithm of Vazirani, that gives an approximation guarantee of 3 for the optimal solution for the problem. Furthermore, the algorithm of Vazirani is demonstrated by an easy problem that shows the technicalities of the algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Wu, 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.

Der volle Inhalt der Quelle

Annotation:

La localisation de sites est une des décisions stratégiques les plus importantes pour les entreprises dans le contexte de la mondialisation d'aujourd'hui. Les travaux existant dans la littérature traitant ce type de problèmes se concentrent principalement sur la détermination de l'emplacement des sites et des flux de produits provenant les sites localisés aux clients dans le but de minimiser le coût total de construction, de production et logistiques. Cependant, il est très important de bien choisir simultanément la capacité et la localisation des sites parce que la taille des sites a une grande influence sur ces coûts sur le long terme. La détermination de la location et de capacité des sites reste encore un problème ouvert.Dans cette thèse, nous étudions trois nouvelles variantes de problèmes de location de sites à deux échelons avec la sélection de taille (TECFLP). Les deux premières parties concentrent sur les TECFLPs avec sélection séparée de taille d’usines ou de dépôts. La troisième partie étudie le TECFLP avec sélection simultanée des tailles d’usines et de dépôts. Pour ces problèmes, trois modèles de programmation linéaire mixte sont proposés. Ensuite les approches basées sur la relaxation lagrangienne selon les caractéristiques de chaque problème sont développés. Pour améliorer les meilleures solutions proposées par les approches de relaxation lagrangienne, une méthode de recherche tabou, une méthode hybride de recherche tabou et à voisinage variable, une méthode hybride du recuit simulé et de la recherche tabou sont respectivement adaptées pour ces trois problèmes. Les algorithmes développés sont testés et évalués à travers 810 instances générées aléatoirement. Les résultats numériques montrent que nos méthodes sont capables de fournir des solutions de qualité avec un temps de calcul raisonnable
Facility 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Sevinc, 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.

Der volle Inhalt der Quelle

Annotation:

In this study, a Lagrangean heuristic based on Lagrangean relaxation and subgradient optimization is proposed for the two-stage modular capacitated facility location problem. The objective is to minimize the cost of locating and operating plants and warehouses, plus the cost of transporting goods at both echelons to satisfy the demand of customers. The difference of our study from the two-stage capacitated facility location problem is the existence of multiple capacity levels as a candidate for each plant in the problem. Each capacity level has a minimum production capacity which has to be satisfied to open the relevant capacity level. Obviously, a single capacity level can be selected for an opened facility location. In the second echelon, the warehouses are capacitated and have unique fixed and variable costs for opening and operating. Multiple sourcing is allowed in both transportation echelons. Firstly, we develop a mixed integer linear programming model for the two-stage modular capacitated facility location problem. Then we develop a Lagrangean heuristic to solve the problem efficiently. Our Lagrangean heuristic consists of three main components: Lagrangean relaxation, subgradient optimization and a primal heuristic. Lagrangean relaxation is employed for obtaining the lower bound, subgradient optimization is used for updating the Lagrange multipliers at each iteration, and finally a three-stage primal heuristic is created for generating the upper bound solutions. At the first stage of the upper bound heuristic, global feasibility of the plants and warehouses is inspected and a greedy heuristic is executed, if there is a global infeasibility. At the next stage, an allocation heuristic is used to assign customers to warehouses and warehouses to plants sequentially. At the final stage of the upper bound heuristic, local feasibilities of the plants are investigated and infeasible capacity levels are adjusted if necessary. In order to show the efficiency of the developed heuristic, we have tested our heuristic on 280 problem instances generated randomly but systematically. The results of the experiments show that the developed heuristic is efficient and effective in terms of solution quality and computational effort especially for large instances.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Zarabi, Patrick, und 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.

Der volle Inhalt der Quelle

Annotation:

This thesis in systems engineering and optimization theory aims to solve a facility location problem within the context of a confined space with path and proximity constraints. The thesis was commissioned by LKAB Kiruna, to help in their decision of where to construct a new facility on their industrial premises. The facility location problem was divided into a main problem of finding the best position of the facility, and a sub-problem of how to model distances and feasible areas within this particular context. The distance and feasibility modeling was solved by utilizing graph theory to construct a graph representation of a geographic area and then obtain the necessary distances using Dijkstra’s shortest path algorithm. The main problem was then solved using a mixed integer linear programming formulation which utilizes the distances obtained through the Dijkstra algorithm. The model is also extended to not only decide the placement of one facility but to accommodate the placement of two facilities. The extended model was solved in three ways, a heuristic algorithm, a mixed integer non linear formulation and a mixed integer linear formulation. The results concluded that the implementation of the single facility model was able to obtain optimal solutions consistently. Regarding the extension, the mixed integer linear formulation was deemed to be the best model as it was computationally fast and consistently produced optimal solutions. Finally, several model improvements are identified to increase the applicability to different cases. These improvements could also allow the model to provide more strategical and managerial insights to the facility location decision process. Some future research into metaheuristics and machine learning are also suggested to further improve the usability of the models.
Detta 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Balcik, Burcu. „Multi Item Integrated Location/inventory Problem“. Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/4/1093640/index.pdf.

Der volle Inhalt der Quelle

Annotation:

In this study, the design of a three-level distribution system is considered in which a single supplier ships a number of items to the retailers via a set of distribution centers (DC) and stochastic demand is observed at the retailers. The problem is to specify the number and location of the DCs, and the assignment of the retailers to the DCs in such a way that total facility, transportation, safety stock, and joint ordering and average inventory costs are minimized, and customer service requirements are satisfied. Single source constraints are imposed on the assignment of the retailers to the DCs. The integrated location/inventory model incorporates the inventory management decisions into the strategic location/allocation decisions by considering the benefits of risk pooling and the savings that result in the joint replenishment of a group of items. We develop two heuristic methods to solve the non-linear integer-programming model in an integrated way: (1) Improvement type heuristic, (2) Constructive type heuristic. The heuristic algorithms are tested on a number of problem instances with 81 demand points (retailers) and 4 different types of items. Both of the heuristics are able to generate solutions in very reasonable times. The results are compared to the results of the p-median problem and found that the total cost and the number of DCs can be lowered using our integrated model instead of the p-median problem. Finally, sensitivity analysis is performed with respect to the changes in inventory, transportation, and ordering cost parameters, and variability of the demand.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Hsieh, Pei-Shan, und 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.

Der volle Inhalt der Quelle

Annotation:

Spatial facility location problems (SFLPs) involve the placement of facilities in continuous demand regions. One approach to solving SFLPs is to aggregate demand into discrete points, and then solve the point-based model as a conventional facility location problem (FLP) according to a surrogate model. Solution performance is measured in terms of the percentage of continuous space actually covered in the original SFLP. In this dissertation I explore this approach and examine factors contributing to solution quality. Three error sources are discussed: point representation spacing, multiple possible solutions to the surrogate point-based model, and round-off errors induced by the computer representation of numbers. Some factors—including boundary region surrogate points and surrogate point location—were also found to make significant contributions to coverage errors. A surrogate error measure using a point-based surrogate model was derived to characterize relationships among spacing, facility coverage area, and spatial coverage error. Locating continuous space facilities with full coverage is important but challenging. Demand surrogate points were initially used as a continuous space for constructing the MIP model, and a point-based surrogate FLP was enhanced for extracting multiple solutions with additional constraints that were found to reduce coverage error. Next, a best initial solution was applied to a proposed heuristic algorithm to serve as an improvement procedure. Algorithm performance was evaluated and applied to a problem involving the location of emergency warning sirens in the city of Dublin, Ohio. The effectiveness of the proposed method for solving this and other facility location/network design problems was demonstrated by comparing the results with those reported in recently published papers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Silav, 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.

Der volle Inhalt der Quelle

Annotation:

In this study, we propose a bi-objective facility location model that considers both partial coverage and service to uncovered demands. In this model, it is assumed that the demand nodes within the predefined distance of opened facilities are fully covered and after that distance the coverage level linearly decreases. The objectives are the maximization of the sum of full and partial coverage the minimization of the maximum distance between uncovered demand nodes and their closest opened facilities. We apply two existing Multi Objective Genetic Algorithms (MOGAs), NSGA-II and SPEA-II to the problem. We determine the drawbacks of these MOGAs and develop a new MOGA called modified SPEA-II (mSPEA-II) to avoid the drawbacks. In this method, the fitness function of SPEA-II is modified and the crowding distance calculation of NSGA-II is used. The performance of mSPEA-II is tested on randomly generated problems of different sizes. The results are compared with the solutions resulting from NSGA-II and SPEA-II. Our experiments show that mSPEA-II outperforms both NSGA-II and SPEA-II.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Guerrero, Rueda William Javier. „Models and optimization methods for the inventory-location-routing problem“. Thesis, Troyes, 2014. http://www.theses.fr/2014TROY0002/document.

Der volle Inhalt der Quelle

Annotation:

Cette thèse considère le problème consistant à intégrer les décisions de routage et stockage lors de la conception de la chaîne logistique. Le but est de sélectionner des dépôts parmi un ensemble de candidats pour desservir un ensemble de détaillants à l’aide d’une ﬂotte de véhicules de capacité permettant visiter plus d’un détaillant par route. On cherche à déterminer la localisation de ces dépôts et les tournées des véhicules aﬁn de maintenir leurs niveaux optimaux de stocks. La demande chez les détaillants est connue à l’avance. Des applications dans les domaines de la logistique humanitaire et militaire sont envisageables. Pour résoudre le problème, deux matheuristiques sont proposées. Dans la première partie, une méthode coopérative qui combine des méthodes exactes pour le problème de conception de la chaîne logistique et des méthodes heuristiques de routage est présentée. Dans la deuxième partie, une méthode de décomposition utilisant une réformulation de Dantzig-Wolf sur les variables de routage est proposée. L’algorithme intègre les concepts de génération de colonnes, relaxation lagrangienne et recherche locale. Les résultats montrent la capacité des algorithmes à trouver des solutions de bonne qualité et nous estimons de façon empirique l’impact de considérer un modèle intégré au lieu d’utiliser une méthode d’optimisation séquentielle. De plus, les résultats des méthodes présentées sur des sous-problèmes sont aussi étudiés. Ces sont: le problème de localisation-routage, le problème de tournées avec gestion de stocks, et le problème de plus court chemin généralisé
The 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 ﬂeet of vehicles over a ﬁnite 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 ﬁrst 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Rahmani, Younes. „The Multi-product Location-Routing Problem with Pickup and Delivery“. Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331/document.

Der volle Inhalt der Quelle

Annotation:

Dans les problèmes de localisation-routage classiques (LRP), il s'agit de combiner des décisions stratégiques liées aux choix des sites à ouvrir (centres de traitement) avec des décisions tactiques et opérationnelles liées à l'affectation des clients aux sites sélectionnés et a la confection des tournées associées. Cette thèse propose de nouveaux modèles de localisation-routage permettant de résoudre des problématiques issues de réseaux logistiques, devenus aujourd'hui de plus en plus complexes vu la nécessité de mutualisation de ressources pour intégrer des contraintes de développement durable et des prix de carburants qui semblent augmenter de manière irrémédiable. Plus précisément, trois aspects ont été intégrés pour généraliser les modèles LRP classiques de la littérature : 1) l'aspect pickup and delivery, 2) l'aspect multi-produits, et 3) la possibilité de visiter un ou plusieurs centres de traitement dans une tournée donnée. Nous avons étudié deux schémas logistiques, qui ont donné lieu à deux nouveaux modèles de localisation et de routage, le MPLRP-PD (LRP with multi-product and pickup and delivery), qui peut être vu comme une extension des problèmes de tournées de véhicules avec collecte et livraison, intégrant une décision tactique liée à la localisation des centres de traitement (noeud avec collecte et livraison) dans un réseau de distribution à un seul échelon, et le 2E-MPLRP-PD (Two-echelon LRP with multi-product and pickup and delivery) qui est une généralisation du LRP à deux échelons avec les contraintes citées plus-haut. Ces deux modèles ont été formalisés par des programmes linéaires en variables mixtes (MIP). Des techniques de résolution, basées sur des méthodes de type heuristique, clustering, métaheuristique, ont été proposées pour résoudre le MPLRP-PD et le 2E-MPLRP-PD. Les jeux d'essais de la littérature ont été généralisés pour tester et valider les algorithmes proposés
In 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

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.

Der volle Inhalt der Quelle

Annotation:

L'agencement d'espace est un problème courant dans la plupart des secteurs industriels. Ce problème est de nature continue et discret et il est considéré comme un problème NP-difficile. Les méthodes d'optimisation traditionnelles, plus appropriées pour une recherche locale sont difficilement utilisables aux problèmes d'agencement. Afin de contourner ces limitations inhérentes aux méthodes classiques, nous proposons deux algorithmes adaptés aux problèmes d'agencement statique de composants de différentes tailles. Pour les problèmes d'agencement considérés, les fonctions objectives à minimiser sont non linéaires et représentent les coûts associés aux sommes pondérées des distances entre les composants. La première approche que nous considérons est une méthode hybride en deux étapes. La première étape consiste à construire un agencement en se basant sur la méthode dite "bas-gauche" comme une solution locale. Ensuite, la solution obtenue est améliorée en appliquant un algorithme génétique modifié. Les opérateurs de croisement et de mutation sont alors adaptés pour prendre en compte les spécificités du problème d'agencement. La deuxième approche est une combinaison entre une recherche locale et globale. Dans ce cas, l'algorithme génétique est également modifié par l'introduction d'un opérateur spécialisé pour le traitement des rotations des composants. Il permet notamment d'éviter le couplage entre les variables réelles et entières et permet également de réduire considérablement le nombre de variables du problème d'optimisation. Les performances des deux approches sont testées et comparées avec les exemples de référence extraits des publications traitant du problème d'optimisation d'agencement. Nous démontrons que les deux approches que nous proposons obtiennent de meilleures performances que les approches existantes
A 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

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.

Der volle Inhalt der Quelle

Annotation:

Thesis (MComm)--Stellenbosch University, 2013.
ENGLISH 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

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.

Der volle Inhalt der Quelle

Annotation:

Dans les dernières décennies, l'augmentation de la consommation des services de soins et la croissance de la population ont fait de l'élimination du gaspillage et l'amélioration continue de la productivité de plus en plus cruciale pour les hôpitaux. La productivité et l'efficacité d'un hôpital dépendent des conditions de travail des soignants qui sont influencés fortement par l'organisation des lieux de travail et des installations [Dares (2013)]. L’agencement des installations consiste à "déterminer l'organisation physique d'un système de production et de trouver l’arrangement le plus efficace de ‘n’ installations dans ‘n’ positions" [Singh et Sharma (2006)]. L’agencement des installations a un grand impact sur la productivité et l'efficacité du fonctionnement d'un hôpital. Etant conscient de ce besoin, le travail que nous présentons vise à trouver une solution à l’agencement des salles du Bloc Opératoire "le coeur de l'hôpital", ainsi que les salles annexes en proposant un outil intelligent que nous mettons à la disposition des maitres d’ouvrages pour optimiser leur conception du bloc opératoire. Les méthodes que nous avons explorées pour la réalisation de ce travail sont les méthodes exactes, les heuristiques, les métaheuristiques et les méthodes intelligentes, ce qui nous a permis de comparer les différentes approches afin de fournir la meilleure solution pour différents scénarios de problèmes. Nous présentons les contributions majeures de notre travail, à commencer par l'application de la programmation mathématique en nombres entiers mixtes (Mixed Integer Programming (MIP)) pour résoudre le problème d’agencement du bloc opératoire (Operating Theater Layout Problem (OTLP)) comme la première contribution scientifique. Ce travail considère trois structures différentes (multi-section, multi-étage et multi-rangé) dans deux types d'environnement différents, tout en optimisant deux fonctions objectifs différents. La combinaison de ces différentes composantes donne lieu à neuf modèles MIP pour résoudre l’OTLP pour lesquels une solution optimale a été atteinte pour des problèmes avec jusqu'à quarante salles. L'utilisation de Systèmes Multi-Agents (MAS) pour résoudre le problème d’agencement des installations est la deuxième contribution scientifique que nous présentons dans le cinquième chapitre. Dans la littérature, on retrouve un seul travail [Tarkesh et al., (2009)] ayant appliqué le MAS pour résoudre des problèmes de petites tailles, ce qui rend notre travail, le premier adoptant MAS pour répondre à la fois le FLP sous environnement statique et dynamique pour des problèmes de grande taille en utilisant un algorithme en trois étapes pour résoudre OTLP. La plate-forme multi-agents développée exploite les trois différents protocoles de communication d’agents, à savoir la coordination, la coopération et la négociation pour concevoir différentes architectures d’agents afin de faire face à l’OTLP statique et dynamique. La dernière contribution consistant en l'utilisation de l’optimisation par essaim de particules (Particle Swarm Optimization (PSO)) sous une représentation continue de l’espace de recherche pour résoudre le problème d’agencement multi-rangée est présentée dans le sixième chapitre. Puisque la PSO est généralement utilisé pour résoudre les problèmes d’affectation ou les FLP avec une représentation discrète, la formulation actuelle est parmi les rares travaux traitant la représentation continue du FLP. Nous avons conçu une nouvelle technique de codage des particules et des heuristiques appropriées pour générer des solutions initiales et pour effectuer la procédure de recherche locale. Une autre nouveauté est liée à l'application de la PSO à un problème de structure multi-rangé, qui n'a pas été abordé auparavant car à notre connaissance, les travaux avec la PSO ont formulé le FLP comme une structure d’une seule rangée ou dans le meilleur des scénarios, comme une structure à deux rangées
In 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

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.

Der volle Inhalt der Quelle

Annotation:

Dans les problèmes de localisation-routage classiques (LRP), il s'agit de combiner des décisions stratégiques liées aux choix des sites à ouvrir (centres de traitement) avec des décisions tactiques et opérationnelles liées à l'affectation des clients aux sites sélectionnés et a la confection des tournées associées. Cette thèse propose de nouveaux modèles de localisation-routage permettant de résoudre des problématiques issues de réseaux logistiques, devenus aujourd'hui de plus en plus complexes vu la nécessité de mutualisation de ressources pour intégrer des contraintes de développement durable et des prix de carburants qui semblent augmenter de manière irrémédiable. Plus précisément, trois aspects ont été intégrés pour généraliser les modèles LRP classiques de la littérature : 1) l'aspect pickup and delivery, 2) l'aspect multi-produits, et 3) la possibilité de visiter un ou plusieurs centres de traitement dans une tournée donnée. Nous avons étudié deux schémas logistiques, qui ont donné lieu à deux nouveaux modèles de localisation et de routage, le MPLRP-PD (LRP with multi-product and pickup and delivery), qui peut être vu comme une extension des problèmes de tournées de véhicules avec collecte et livraison, intégrant une décision tactique liée à la localisation des centres de traitement (noeud avec collecte et livraison) dans un réseau de distribution à un seul échelon, et le 2E-MPLRP-PD (Two-echelon LRP with multi-product and pickup and delivery) qui est une généralisation du LRP à deux échelons avec les contraintes citées plus-haut. Ces deux modèles ont été formalisés par des programmes linéaires en variables mixtes (MIP). Des techniques de résolution, basées sur des méthodes de type heuristique, clustering, métaheuristique, ont été proposées pour résoudre le MPLRP-PD et le 2E-MPLRP-PD. Les jeux d'essais de la littérature ont été généralisés pour tester et valider les algorithmes proposés
In 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Mangotra, Divya. „Integrated Decisions for Supply Chain Design and Inventory Allocation Problem“. Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19814.

Der volle Inhalt der Quelle

Annotation:

Manufacturing outsourcing in the U.S. has never been stronger than it is today. Increased outsourcing has led to significant changes in the design of the retail distribution network. While the traditional distribution network had the manufacturing plants supplying goods to the retail stores directly, the off-shore manufacturing has increased the network's demand for transportation and warehousing to deliver the goods. Thus, most companies have a complex distribution network with several import and regional distribution centers (RDC). In this thesis, we study an integrated facility location and inventory allocation problem for designing a distribution network with multiple national (import) distribution centers (NDC) and retailers. The key decisions are where to locate the RDCs and how much inventory to hold at the different locations such that the total network cost is minimized under a pre-defined operational rule for the distribution of goods. In particular, the inventory cost analysis is based on the continuous review batch ordering policy and the base-stock policy. Both Type-I (probability of stock-outs) and Type-II (fill-rate) service level measures are used in the analysis. Two different models are presented in this thesis for solving the integrated facility location-inventory allocation problem. The first model, continuous approximation (CA), assumes the distribution network to be located in a continuous region and replaces the discrete store locations with a store density function. The second model is a discrete representation of the problem as a mixed integer programming problem. Both the models take a nonlinear form and solution techniques are developed using the theory of nonlinear programming and linear reformulation of nonlinear problems. The goal of the first part of the thesis is to model the problem using a modified CA approach and an iterative solution scheme is presented to solve it. The main contribution of this work lies in developing a refined CA modeling technique when the discrete data cannot be modeled by a continuous function. In addition, the numerical analysis suggests that the total network cost is significantly lower in the case of the integrated model as compared with the non-integrated model. It is also shown that the regular CA approach leads to a solution which is inferior to the solution obtained by the modified CA approach. Our analysis shows that the type of service measure used affects the network design. In the second part of the thesis, the problem is modeled as a nonlinear mixed integer program and a linear reformulation solution technique is proposed to obtain a lower bound on the original problem. Computational results are presented for small problem instances. We conclude this part of the thesis by presenting an integrated model when a base stock inventory policy is used. A drop-decomposition heuristic is proposed to solve this problem.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Menth, Megan. „An agent-based modeling approach to assess coordination among humanitarian relief providers“. Thesis, Kansas State University, 2016. http://hdl.handle.net/2097/32589.

Der volle Inhalt der Quelle

Annotation:

Master of Science
Department 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

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/.

Der volle Inhalt der Quelle

Annotation:

From 1992 to 2012 4.4 billion people were affected by disasters with almost 2 trillion USD in damages and 1.3 million people killed worldwide. The increasing threat of disasters stresses the need to provide solutions for the challenges faced by disaster managers, such as the logistical deployment of resources required to provide relief to victims. The location of emergency facilities, stock prepositioning, evacuation, inventory management, resource allocation, and relief distribution have been identified to directly impact the relief provided to victims during the disaster. Managing appropriately these factors is critical to reduce suffering. Disaster management commonly attracts several organisations working alongside each other and sharing resources to cope with the emergency. Coordinating these agencies is a complex task but there is little research considering multiple organisations, and none actually optimising the number of actors required to avoid shortages and convergence. The aim of the this research is to develop a system for disaster management based on a combination of optimisation techniques and geographical information systems (GIS) to aid multi-organisational decision-making. An integrated decision system was created comprising a cartographic model implemented in GIS to discard floodable facilities, combined with two models focused on optimising the decisions regarding location of emergency facilities, stock prepositioning, the allocation of resources and relief distribution, along with the number of actors required to perform these activities. Three in-depth case studies in Mexico were studied gathering information from different organisations. The cartographic model proved to reduce the risk to select unsuitable facilities. The preparedness and response models showed the capacity to optimise the decisions and the number of organisations required for logistical activities, pointing towards an excess of actors involved in all cases. The system as a whole demonstrated its capacity to provide integrated support for disaster preparedness and response, along with the existence of room for improvement for Mexican organisations in flood management.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

An, Yu. „Reliable Design and Operations of Infrastructure Systems“. Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5345.

Der volle Inhalt der Quelle

Annotation:

The reliability issue of the infrastructure systems has become one of the major concerns of the system operators. This dissertation is a collection of four published and working papers that address the specific reliable design and operations problems from three different application settings: transportation/telecommunications network, distribution network, and power plant. In these four projects, key random factors like site disruption and uncertain demand are explicitly considered and proper research tools including stochastic programming, robust optimization, and variants of robust optimization are applied to formulate the problems based on which the important and challenging modelling elements (nonlinear congestion, disruption caused demand variation, etc.) can be introduced and studied. Besides, for each of the optimization models, we also develop advanced solution algorithms that can solve large-scale instances within a short amount of time and devise comprehensive numerical experiments to derive insights. The modelling techniques and solution methods can be easily extended to study reliability issues in other applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Peng, Zhihao. „Optimisation par essaims particulaires pour la logistique urbaine“. Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCA010/document.

Der volle Inhalt der Quelle

Annotation:

Dans cette thèse, nous nous intéressons à la gestion des flux de marchandises en zone urbaine aussi appelée logistique du dernier kilomètre, et associée à divers enjeux d’actualité : économique, environnemental, et sociétal. Quatre principaux acteurs sont concernés par ces enjeux : chargeurs, clients, transporteurs et collectivités, ayant chacun des priorités différentes (amélioration de la qualité de service, minimisation de la distance parcourue, réduction des émissions de gaz à effet de serre, …). Face à ces défis dans la ville, un levier d’action possible consiste à optimiser les tournées effectuées pour la livraison et/ou la collecte des marchandises. Trois types de flux urbains sont considérés : en provenance ou à destination de la ville, et intra-urbains. Pour les flux sortants et entrants dans la ville, les marchandises sont d’abord regroupées dans un entrepôt situé en périphérie urbaine. S’il existe plusieurs entrepôts, le problème de planification associé est de type Location Routing Problem (LRP). Nous en étudions une de ses variantes appelée Capacitated Location Routing Problem (CLRP). Dans cette dernière, en respectant la contrainte de capacité imposée sur les véhicules et les dépôts, la localisation des dépôts et la planification des tournées sont considérées en même temps. L’objectif est de minimiser le coût total qui est constitué du coût d’ouverture des dépôts, du coût d’utilisation des véhicules, et du coût de la distance parcourue. Pour tous les flux, nous cherchons également à résoudre un problème de tournées de type Pickup and Delivery Problem (PDP), dans lequel une flotte de véhicules effectue simultanément des opérations de collecte et de livraison. Nous nous sommes focalisés sur deux de ses variantes : la variante sélective où toutes les demandes ne sont pas toujours satisfaites, dans un contexte de demandes appairées et de sites contraints par des horaires d’ouverture et fermeture (Selective Pickup and Delivery Problem with Time Windows and Paired Demands, ou SPDPTWPD). La seconde variante étudiée est l’extension de la première en ajoutant la possibilité d’effectuer les transports en plusieurs étapes par l’introduction d’opérations d’échanges des marchandises entre véhicules en des sites de transfert (Selective Pickup and Delivery with Transfers ou SPDPT). Les objectifs considérés pour ces deux variantes de PDP sont de maximiser le profit et de minimiser la distance. Chaque problème étudié fait l’objet d’une description formelle, d’une modélisation mathématique sous forme de programme linéaire, puis d’une résolution par des méthodes exactes, heuristiques et/ou métaheuristiques. En particulier nous avons développé des algorithmes basés sur une métaheuristique appelée Particle Swarm Optimization, que nous avons hybridée avec de la recherche locale. Les approches sont validées sur des instances de différentes tailles issues de la littérature et/ou que nous avons générées. Les résultats sont analysés de façon critique pour mettre en évidence les avantages et inconvénients de chaque méthode
In 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Posta, Marius. „« Resolution Search » et problèmes d’optimisation discrète“. Thèse, Avignon, 2012. http://hdl.handle.net/1866/8393.

Der volle Inhalt der Quelle

Annotation:

Les problèmes d’optimisation discrète sont pour beaucoup difficiles à résoudre, de par leur nature combinatoire. Citons par exemple les problèmes de programmation linéaire en nombres entiers. Une approche couramment employée pour les résoudre exactement est l’approche de Séparation et Évaluation Progressive. Une approche différente appelée « Resolution Search » a été proposée par Chvátal en 1997 pour résoudre exactement des problèmes d’optimisation à variables 0-1, mais elle reste mal connue et n’a été que peu appliquée depuis. Cette thèse tente de remédier à cela, avec un succès partiel. Une première contribution consiste en la généralisation de Resolution Search à tout problème d’optimisation discrète, tout en introduisant de nouveaux concepts et définitions. Ensuite, afin de confirmer l’intérêt de cette approche, nous avons essayé de l’appliquer en pratique pour résoudre efficacement des problèmes bien connus. Bien que notre recherche n’ait pas abouti sur ce point, elle nous a amené à de nouvelles méthodes pour résoudre exactement les problèmes d’affectation généralisée et de localisation simple. Après avoir présenté ces méthodes, la thèse conclut avec un bilan et des perspectives sur l’application pratique de Resolution Search.
The 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Dkhil, 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.

Der volle Inhalt der Quelle

Annotation:

Notre travail s’intéresse à un cas très particulier des terminaux à conteneurs, il s’agit des terminaux à conteneurs automatisés, qui en plus des véhicules autoguidés, sont équipés de grues de quai et de grues de stockage automatiques (grues de cour), ce qui pousse souvent les scientifiques à considérer les problèmes d’ordonnancement intégré dans les terminaux automatisés ou semi-automatisés. Nous traitons dans ce travail l’optimisation de plusieurs objectifs pour stocker les conteneurs d'une manière efficace et réaliste. Nous traitons le problème d’ordonnancement intégré considérant les trois équipements d’un terminal à conteneurs automatisé soient: les véhicules autoguidés, les grues de quai et les grues de baie (éventuellement). L’objectif principal de cette étude est la minimisation du coût opérationnel de stockage de conteneurs dans un terminal maritime automatisé
AIn 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

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.

Der volle Inhalt der Quelle

Annotation:

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico
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.
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

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.

Der volle Inhalt der Quelle

Annotation:

DIAS, Fábio Carlos Sousa. Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica. 2008. 81 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2008.
Submitted 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

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.

Der volle Inhalt der Quelle

Annotation:

L’environnement urbain est fortement ancré dans la gestion des flux logistiques. La mutualisation de ces différents flux apporte alors une solution qualitative répondant aux critères environnementaux, économiques et sociétaux. Cette thèse propose une approche pour la mise en place des centres de distribution urbains (CDU) en combinant la logistique de distribution avec la logistique inverse (flux montants et flux descendants). L’objectif principal de ces CDU est d'assurer un développement durable dans les villes modernes. L’hétérogénéité des pratiques de la logistique de distribution et de la logistique inverse constitue le principal verrou scientifique. La mutualisation de ces différents flux apporte alors une solution qualitative et durable dès lors qu’elle répond aux critères attendus : environnementaux, économiques et sociétaux. Dans un contexte de logistique globale, nous nous sommes basés sur les problèmes de localisation de plateformes HLP « Hub Location Problem » afin de formuler le problème de localisation des CDU selon un critère de maximisation du profit par le choix du meilleur emplacement parmi ceux disponibles. Nous avons calculé les localisations partiellement possibles, tout en garantissant le traitement des flux retournés (collecte, tri, revente) et aussi en tenant compte des coûts socio-environnementaux. Par la suite, nous avons utilisé des outils de résolution du modèle proposé via des algorithmes d’optimisation. L’efficacité de ces algorithmes a été confirmée par un ensemble de jeux de données et de rapports d’analyse d’impacts. La dynamique liée à la fiabilité des CDU dans l’exécution du service par la prise en compte d’une politique de coordination inter-CDU fait aussi partie de notre étude. Nous nous sommes intéressés à l’aspect de disponibilité pour garantir les livraisons à temps. En effet, l’indisponibilité du système peut être due aux pannes aléatoires, aux actions de maintenance préventive planifiées, etc. Par conséquent, nous présentons une solution qui permet de satisfaire la demande journalière de manière ponctuelle par l’intégration d’une approche collaborative entre les différents sites. Il s’agit d’un modèle d’optimisation de la politique de coordination inter-CDU avec une stratégie de sous-traitance des livraisons en cas d’indisponibilité
The 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

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.

Der volle Inhalt der Quelle

Annotation:

Cette thèse porte sur le développement d'un modèle mathématique et d'algorithmes pour optimiser la conception de chaîne logistiques, en intégrant des dimensions financières. Nous proposons un modèle multi-périodique, avec contraintes de capacité, sur un réseau à un échelon et avec un produit unique. L'objectif est de maximiser la valeur présente ajustée (APV) de l'entreprise. Les variables de décision binaires sont liées à la localisation des sites logistiques ; les variables continues concernent les flux de marchandises et la planification de la dette. Le modèle mathématique est tout d'abord évalué en résolvant, à l'aide d'un solveur, un ensemble d'instances générées aléatoirement. Nous proposons une approche séquentielle, consistant à optimiser d'abord les variables logistiques, puis les variables financières. Nous décrivons ensuite une métaheuristique de Recherche à Voisinage Large (LNS) pour résoudre des instances de plus grande taille. Enfin, nous considérons le cas où les dimensions logistiques et financières comme deux objectifs indépendants. Nous proposons un algorithme de type Multidirectional local search, utilisant le LNS comme algorithme mono-objectif. Des expériences numériques approfondies évaluent la pertinence de notre modèle et comparent les performances de nos algorithmes à celles du solveur
This 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

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.

Der volle Inhalt der Quelle

Annotation:

Cette thèse porte sur le développement de modèles mathématiques et d’algorithmes d’optimisation pour la conception de chaînes logistiques durables. Nous proposons des modèles mono-périodiques, multi-produits et multi-modes de transport à quatre niveaux (fournisseurs, unités de production, entrepôts et clients) couvrant les piliers économique et environnemental du développement durable. Les variables de décision concernent la localisation des sites logistiques intermédiaires (unités de production et entrepôts), les choix de technologie et de mode de transport, et la détermination des flux de produits. Un premier modèle est basé uniquement sur la minimisation des coûts totaux. Ce modèle est étendu au cas bi-objectif en considérant la minimisation des émissions de CO2. Nous proposons une procédure d’optimisation basée sur la recherche à voisinage large (LNS : Large Neighborhood Search). L’application de cette méthode à un problème à variables mixtes tel que la conception de chaîne logistique est inédite. Notre extension au cas bi-objectif fait intervenir l’algorithme récent de recherche locale multi-directionnelle. Les expérimentations numériques permettent d’évaluer la pertinence de nos modèles et de comparer les performances de nos algorithmes à celles d’un solveur du marché
This 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

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.

Der volle Inhalt der Quelle

Annotation:

Le système de santé français est confronté au défi d’augmentation permanente de la demande en soins, sous une forte pression financière. Dans la stratégie nationale de santé, une des grandes orientations est de développer une base de coopération impliquant l’ensemble des acteurs et de leur engagement. Ces enjeux demandent au génie hospitalier de rechercher une efficience dans une échelle encore plus globale, ce qui demande d’intégrer les problèmes locaux et leurs outils d’optimisation qui présentent en général un haut degré de fragmentation, afin de contribuer à l’amélioration globale du système. Dans ce contexte-là, initialisé par un projet de conception du système de soins en réseau avec ressource de production mutualisée, nous proposons à travers ce mémoire de thèse une méthode générique pour résoudre le problème d’optimisation multi-niveaux dans lequel les décisions interdépendantes doivent être prises à différents niveaux dans une structure hiérarchique, ou aux étapes successives. Les décisions faites sont souvent corrélées, surtout pour une topologie de décisions enchaînées en hiérarchique que nous définissons sous le terme de « sous-structure optimale feedback ». La résolution de ce type de problème doit s’adapter pour prendre en compte autant que possible les implications liées aux décisions corrélées. La méthode proposée est basée sur la méta-heuristique PSO, elle utilise une procédure récursive pour définir le transfert des paramètres des sous-problèmes descendant et des évaluations ascendant à travers de multiples espaces de recherche, en assurant la cohérence de la convergence du problème global. Les applications et les analyses ont montrées que la méthode est assez générique et capable de produire la performance et la qualité de résolution proche de celles de la littérature
French 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

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.

Der volle Inhalt der Quelle

Annotation:

L’environnement urbain est fortement ancré dans la gestion des flux logistiques. La mutualisation de ces différents flux apporte alors une solution qualitative répondant aux critères environnementaux, économiques et sociétaux. Cette thèse propose une approche pour la mise en place des centres de distribution urbains (CDU) en combinant la logistique de distribution avec la logistique inverse (flux montants et flux descendants). L’objectif principal de ces CDU est d'assurer un développement durable dans les villes modernes. L’hétérogénéité des pratiques de la logistique de distribution et de la logistique inverse constitue le principal verrou scientifique. La mutualisation de ces différents flux apporte alors une solution qualitative et durable dès lors qu’elle répond aux critères attendus : environnementaux, économiques et sociétaux. Dans un contexte de logistique globale, nous nous sommes basés sur les problèmes de localisation de plateformes HLP « Hub Location Problem » afin de formuler le problème de localisation des CDU selon un critère de maximisation du profit par le choix du meilleur emplacement parmi ceux disponibles. Nous avons calculé les localisations partiellement possibles, tout en garantissant le traitement des flux retournés (collecte, tri, revente) et aussi en tenant compte des coûts socio-environnementaux. Par la suite, nous avons utilisé des outils de résolution du modèle proposé via des algorithmes d’optimisation. L’efficacité de ces algorithmes a été confirmée par un ensemble de jeux de données et de rapports d’analyse d’impacts. La dynamique liée à la fiabilité des CDU dans l’exécution du service par la prise en compte d’une politique de coordination inter-CDU fait aussi partie de notre étude. Nous nous sommes intéressés à l’aspect de disponibilité pour garantir les livraisons à temps. En effet, l’indisponibilité du système peut être due aux pannes aléatoires, aux actions de maintenance préventive planifiées, etc. Par conséquent, nous présentons une solution qui permet de satisfaire la demande journalière de manière ponctuelle par l’intégration d’une approche collaborative entre les différents sites. Il s’agit d’un modèle d’optimisation de la politique de coordination inter-CDU avec une stratégie de sous-traitance des livraisons en cas d’indisponibilité
The 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

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.

Der volle Inhalt der Quelle

Annotation:

Le but du travail réalisé dans cette thèse est de fournir aux fournisseurs de services une solution qui est capable de non seulement déployer les services dans le cloud de façon économique, automatique, mais aussi à grande échelle. La première contribution traite le problème de la construction d'un nouveau service demandé par le client à partir de services disponibles dans le cloud de manière à satisfaire les exigences en termes de qualité de service ainsi qu'en termes de coût. Nous présentons ce problème par un modèle analytique et proposons un algorithme heuristique dont la performance est améliorée de 20-30% par rapport aux autres approches. La seconde contribution est une solution pour déployer les services dans le cloud en considérant les demandes des utilisateurs finaux. Pour assurer qualité de services dans une grande échelle, le service demandé est dupliqué et distribué dans le réseau; chacun de ses réplicas servira les utilisateurs à proximité. Le plan d'approvisionnement selon lequel le service est dupliqué dépend de sa demande, ce qui ne cesse pas de changer en quantité ainsi qu'en distribution, ce qui rend le problème plus compliqué. Nous proposons une solution qui est capable de s'adapter aux changements dans le réseau, y compris ceux des demandes de ses utilisateurs. Enfin, nous proposons un système basé sur OpenStack qui permet de déployer les services complexes dans un cloud qui couvre différente locations (cloud multi-site). A partir d'une demande du client, le système automatiquement calcule le plan d'approvisionnement optimal et le déploie en respectant les contraintes du client.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Carrara, 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/.

Der volle Inhalt der Quelle

Annotation:

O presente trabalho a partir da caracterização da problemática dos transportes na área central de Uberlândia (MG), e com a utilização das ferramentas do software TransCAD (SIG-T), como problema de localização de instalações e roteirização de veículos, buscou-se propor uma alternativa que contribuísse para a distribuição urbana de cargas, principalmente nas áreas centrais urbanas, com foco na minimização dos custos de transporte e considerando a realidade brasileira e as atuais discussões sobre alternativas de inovações operacionais e tecnológicas. O método escolhido para o estudo de caso baseou-se nos dados georeferenciados da rede viária urbana e de movimentação de cargas na área central da cidade, de forma a orientar estratégias modernas e mais eficazes para distribuição física de produtos e proporcionar melhores condições no fluxo nestas áreas. O método ainda apoiou-se na definição e caracterização do conceito de logística urbana e de terminais logísticos, e a influência que exerceriam na distribuição urbana de cargas, principalmente nas áreas centrais, da cidade de Uberlândia. O software mostrou-se uma ferramenta de apoio a decisões no planejamento urbano. Pode-se validar o uso do software TransCAD na busca por soluções ótimas para os terminais logísticos e na roteirização dos veículos que compõem a frota dos terminais, assim, acredita-se que é uma ferramenta para operações logísticas. Mesmo com algumas limitações do software, este contribui para que chegássemos aos resultados finais alcançando os objetivos iniciais propostos.
The 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

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.

Der volle Inhalt der Quelle

Annotation:

Les entreprises de transport et de distribution sont confrontées à des difficultés d'exploitation liées à la taille et à la complexité de leur processus de livraison. Dans cette problématique, nous proposons une approche globale du Problème Général de Livraison (PGL).Au niveau méthodologique, c'est une approche hiérarchique (stratégique, tactique, opérationnelle) et structurée. Il s'agit de concevoir et d'exploiter un PGL en le décomposant en problèmes de livraisons élémentaires identifiés et le plus possible indépendants les uns des autres (problèmes de transport, de hubs, d'agences, de tournées...).Au niveau algorithmique, des modèles et algorithmes de résolution ont été proposés pour résoudre ces problèmes élémentaires de livraison dans la phase opérationnelle en tenant compte, en particulier, du nombre et de la capacité limités des moyens de transport.Au niveau applicatif, deux exemples réels sont traités : le système de livraison d'une entreprise de Vente à Distance et le système de livraison des casernes de pompiers du Nord de la France à partir de la pharmacie centrale de Lille

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Danach, Kassem. „Hyperheuristiques pour des problèmes d’optimisation en logistique“. Thesis, Ecole centrale de Lille, 2016. http://www.theses.fr/2016ECLI0025/document.

Der volle Inhalt der Quelle

Annotation:

Le succès dans l'utilisation de méthodes exactes d’optimisation combinatoire pour des problèmes de grande taille est encore limité à certains problèmes ou à des classes spécifiques d'instances de problèmes. Une approche alternative consiste soit à utiliser des métaheuristiques ou des matheuristiques qui reposent en partie sur des méthodes exactes. Dans le contexte de l'optimisation combinatoire, nous nous intéressons des heuristiques permettant de choisir les heuristiques appliquées au problème traité. Dans cette thèse, nous nous concentrons sur l'optimisation à l’aide d’hyperheuristiques pour des problèmes logistiques. Nous proposons un cadre hyperheuristique qui effectue une recherche dans l'espace des algorithmes heuristiques et apprend comment changer l'heuristique courante systématiquement tout au long du processus de telle sorte qu'une bonne séquence d'heuristiques permet d’obtenir des solutions de haute qualité. Nous étudions plus particulièrement deux problèmes en logistique pour lesquels nous proposons des HHs: un problème de planification d’interventions sur des puits de forage et un problème conjoint de localisation de hubs et de routage. Ensuite, nous comparons les performances de plusieurs HH décrites dans la littérature pour le second problème abordé reposant sur différentes méthodes de sélection heuristique telles que la sélection aléatoire, la fonction de choix, une approche de Q-Learning et un algorithme de colonie de fourmis. Les résultats numériques prouvent l'efficacité de HHs pour les deux problèmes traités, et la pertinence d'inclure l'information venant d’une relaxation de Lagrangienne pour le deuxième problème
Success 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

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.

Der volle Inhalt der Quelle

Annotation:

A cause du réchauffement climatique, le nombre et l’intensité des feux de forêts augmentent autour du globe. Dansce contexte, la construction de refuges contre le feu est une solution de plus en plus envisagée. Le problème consisteessentiellement à localiser p refuges de sorte à minimiser la distance maximale qui sépare un usager du plus procherefuge accessible en cas de feux. Le territoire considéré est divisé en zones et est modélisé comme un graphe auxarêtes pondérées. Un départ de feux sur une seule zone (c’est-à-dire sur un sommet). La principale conséquence d’unfeu est que les chemins d’évacuation sont modifiés de deux manières. Premièrement, un chemin d’évacuation ne peutpas traverser le sommet en feu. Deuxièmement, le fait qu’une personne proche de l’incendie puisse avoir un choix limitéde direction d’évacuation, ou être sous stress, est modélisé à l’aide d’une stratégie d’évacuation nouvellement définie.Cette stratégie d’évacuation induit des distances d’évacuation particulières qui rendent notre modèle spécifique. Selon letype de données considéré et l’objectif recherché, nous proposons deux problèmes avec ce modèle: le Robust p-CenterUnder Pressure et le Probabilistic p-Center Under Pressure. Nous prouvons que ces deux problèmes sont NP-difficilessur des classes de graphes pertinentes pour notre contexte. Nous proposons également des résultats d’approximationet d’inapproximation. Finalement, nous développons des algorithmes polynomiaux sur des classes de graphes simples,et nous développons des algorithmes mathématiques basés sur la programmation linéaire
The 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

(7407275), Todd Zhen. „Optimal Sensor Placement Problems Under Uncertainty: Models and Applications“. Thesis, 2019.

Den vollen Inhalt der Quelle finden

Annotation:

The problem of optimally placing sensors can often be formulated as a facility location problem. In the literature of operations research, facility location problems are mathematical optimization problems where one or more facilities must be placed in relation to a given number of demand points or customers. Within the context of sensor placement, for example, this translates to placing wireless communication nodes that connect to a set of users or placing smoke detectors to adequately cover a region for safety assurances. However, while the classical facility location problem has been extensively studied, its direct applicability to and eﬀectiveness for the optimal sensor placement problem can be diminished when real-world uncertainties are considered. In addition, the physics of the underlying systems in optimal sensor placement problems can directly impact the eﬀectiveness of facility location formulations. Extensions to existing location formulations that are tailored for the system of interest are necessary to ensure optimal sensor network design.

This dissertation focuses on developing and applying problem-specific optimal sensor placement methods under uncertainty in sensor performance. With the classical discrete facility location problems as a basis, our models are formulated as mixed-integer linear and nonlinear programs that, depending on the specific application, can also be in the form of a stochastic program, a robust optimization framework, or require probability distributions for uncertain parameters. We consider optimal placement problems from three different areas, particularly the optimal placement of data concentrators in Smart Grid communications networks, the optimal placement of flame detectors within petrochemical facilities, and the optimal selection of infectious disease detection sites across a nation. For each application, we carefully consider the underlying physics of the system and the uncertainties and then develop extensions of previous sensor placement formulations that effectively handle these qualities. In addition, depending on the degree of nonlinear complexity of the problem, specific relaxations and iterative solution strategies are developed to improve the ability to find tractable solutions. All proposed models are implemented in Pyomo, a Python-based optimization modeling language, and solved with state-of-the-art optimization solvers, including IPOPT, Gurobi, and BARON for nonlinear, mixed-integer, and mixed-integer nonlinear programs, respectively. Numerical results show that our tailored formulations for the problems of interest are effective in handling uncertainties and provide valuable sensor placement design frameworks for their respective industries. Furthermore, our extensions for placement of sensors under probabilistic failure are appropriately general for application in other areas.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

chen, mei-ling, und 陳美玲. „Multiple Objective Competitive Facility Location Problem“. Thesis, 1998. http://ndltd.ncl.edu.tw/handle/83738222746155137648.

Der volle Inhalt der Quelle

Annotation:

碩士
國立中央大學
土木工程學系
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Hu, Cheng-hong, und 胡正宏. „The Capacitated Dynamic Facility Location Problem“. Thesis, 2003. http://ndltd.ncl.edu.tw/handle/20828118810425473748.

Der volle Inhalt der Quelle

Annotation:

碩士
國立高雄第一科技大學
運輸倉儲營運所
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Lin, Ping Ting, und 林娉婷. „The Multi-service Facility Location Problem“. Thesis, 2015. http://ndltd.ncl.edu.tw/handle/73412474625848008988.

Der volle Inhalt der Quelle

Annotation:

碩士
國立清華大學
工業工程與工程管理學系
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

LIN, Chien-Feng, und 林建豐. „Military Fuel Distribution Center Facility Location Problem“. Thesis, 2009. http://ndltd.ncl.edu.tw/handle/70411252524757232592.

Der volle Inhalt der Quelle

Annotation:

碩士
國立高雄第一科技大學
運籌管理所
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

TEDDY und 倪琨珉. „Efficient Heuristics For Facility Location Problem With Foresight“. Thesis, 2014. http://ndltd.ncl.edu.tw/handle/5qfu9w.

Der volle Inhalt der Quelle

Annotation:

碩士
國立臺北科技大學
管理國際學生碩士專班 (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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema „Facility Location Optimisation Problem“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an