scholarly journals An Improved Voronoi-Diagram-Based Algorithm for Continuous Facility Location Problem under Disruptions

2018 ◽  
Vol 10 (9) ◽  
pp. 3099 ◽  
Author(s):  
Jiguang Wang ◽  
Yucai Wu
Keyword(s):  
Supply Chain ◽  
Facility Location ◽  
Voronoi Diagram ◽  
Location Problem ◽  
Facility Location Problem ◽  
Research Problem ◽  
Future Research ◽  
Total Cost ◽  
Disruption Risk ◽  
The Impact

The classical location models implicitly assume that the facilities, once built, will always operate as planned. However, some of the facilities may become unavailable from time to time due to disruptions which highlight the urgent need to effectively manage supply chain disruptions in spite of their low probability of occurrence. Therefore, it is critical to take account of disruptions when designing a resilient supply chain network so that it performs well as a whole even after an accidental disruption. In this paper, a stylized facility location problem is considered in a continuous plane which is solved through an improved Voronoi-diagram-based algorithm under disruption risks. The research problem is to minimize the total cost in normal and failure scenarios. Furthermore, the impact of misestimating the disruption probability is also investigated. The results numerically show that although the estimated disruption probability has a significant impact on the facilities configuration, it has a minor impact on the total quantity of facilities and the expected total cost. Therefore, this paper proposes that the decision-maker should moderately overestimate disruption risk based on the “pessimistic principle”. Finally, the conclusion considers managerial insights and proposes potential areas for future research.

Model of Supply Chain Disruption Risk Defense System

2014 ◽  
Vol 511-512 ◽  
pp. 1239-1243
Author(s):  
Han Qing Li ◽  
Yi Hong Ru
Keyword(s):  
Supply Chain ◽  
Integer Programming ◽  
Location Problem ◽  
Programming Model ◽  
Facility Location Problem ◽  
Mixed Integer ◽  
Defense System ◽  
Supply Chain Risk ◽  
Supply Chain Disruption ◽  
Disruption Risk

This study is comprised of three main problems. Firstly, a supply chain risk defense problem (SCRDP) is proposed. Then, the study considers a facility location problem in the presence of random facility disruptions where the facilities can be defensed with additional investments. It is formulated as a mixed integer programming model. Finally, a case shows a location solution which designs how to distribute the hardened and non-hardened facilities.

scholarly journals Nash Welfare in the Facility Location Problem

2021 ◽  
Author(s):  
Alexander Lam
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Maximum Cost ◽  
Total Cost ◽  
Strategic Behaviour ◽  
Fairness And Efficiency ◽  
Facility Placement

In most facility location research, either an efficient facility placement which minimizes the total cost or a fairer placement which minimizes the maximum cost are typically proposed. To find a solution that is both fair and efficient, we propose converting the agent costs to utilities and placing the facility/ies such that the product of utilities, also known as the Nash welfare, is maximized. We ask whether the Nash welfare's well-studied balance between fairness and efficiency also applies to the facility location setting, and what agent strategic behaviour may occur under this facility placement.

scholarly journals Locating and Designing a Biorefinery Supply Chain under Uncertainty in Navarre: A Stochastic Facility Location Problem Case

2015 ◽  
Vol 10 ◽  
pp. 704-713 ◽  
Author(s):  
Adrián Serrano ◽  
Javier Faulin ◽  
Pablo Astiz ◽  
Mercedes Sánchez ◽  
Javier Belloso
Keyword(s):  
Supply Chain ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Problem Case

scholarly journals Facility Location Problem Approach for Distributed Drones

Symmetry ◽  
2019 ◽  
Vol 11 (1) ◽  
pp. 118 ◽  
Author(s):  
Jared Lynskey ◽  
Kyi Thar ◽  
Thant Oo ◽  
Choong Hong
Keyword(s):  
Energy Consumption ◽  
Facility Location ◽  
Location Problem ◽  
Average Distance ◽  
Optimal Solution ◽  
Facility Location Problem ◽  
Traveling Salesman ◽  
Future Research ◽  
Shortest Route ◽  
Initial Location

Currently, industry and academia are undergoing an evolution in developing the next generation of drone applications. Including the development of autonomous drones that can carry out tasks without the assistance of a human operator. In spite of this, there are still problems left unanswered related to the placement of drone take-off, landing and charging areas. Future policies by governments and aviation agencies are inevitably going to restrict the operational area where drones can take-off and land. Hence, there is a need to develop a system to manage landing and take-off areas for drones. Additionally, we proposed this approach due to the lack of justification for the initial location of drones in current research. Therefore, to provide a foundation for future research, we give a justified reason that allows predetermined location of drones with the use of drone ports. Furthermore, we propose an algorithm to optimally place these drone ports to minimize the average distance drones must travel based on a set of potential drone port locations and tasks generated in a given area. Our approach is derived from the Facility Location problem which produces an efficient near optimal solution to place drone ports that reduces the overall drone energy consumption. Secondly, we apply various traveling salesman algorithms to determine the shortest route the drone must travel to visit all the tasks.

scholarly journals Comparing Evolutionary Strategies on a Biobjective Cultural Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Carolina Lagos ◽  
Broderick Crawford ◽  
Enrique Cabrera ◽  
Ricardo Soto ◽  
José-Miguel Rubio ◽  
...  
Keyword(s):  
Evolutionary Algorithms ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Evolutionary Strategies ◽  
Cultural Algorithm ◽  
Historical Knowledge ◽  
Uncapacitated Facility Location Problem ◽  
Normative Knowledge ◽  
The Impact

Evolutionary algorithms have been widely used to solve large and complex optimisation problems. Cultural algorithms (CAs) are evolutionary algorithms that have been used to solve both single and, to a less extent, multiobjective optimisation problems. In order to solve these optimisation problems, CAs make use of different strategies such as normative knowledge, historical knowledge, circumstantial knowledge, and among others. In this paper we present a comparison among CAs that make use of different evolutionary strategies; the first one implements a historical knowledge, the second one considers a circumstantial knowledge, and the third one implements a normative knowledge. These CAs are applied on a biobjective uncapacitated facility location problem (BOUFLP), the biobjective version of the well-known uncapacitated facility location problem. To the best of our knowledge, only few articles have applied evolutionary multiobjective algorithms on the BOUFLP and none of those has focused on the impact of the evolutionary strategy on the algorithm performance. Our biobjective cultural algorithm, called BOCA, obtains important improvements when compared to other well-known evolutionary biobjective optimisation algorithms such as PAES and NSGA-II. The conflicting objective functions considered in this study are cost minimisation and coverage maximisation. Solutions obtained by each algorithm are compared using a hypervolume S metric.

scholarly journals PENENTUAN LOKASI SMA NEGERI MENGGUNAKAN DIAGRAM VORONOI BERBOBOT DI KOTA DENPASAR

2013 ◽  
Vol 2 (2) ◽  
pp. 27 ◽  
Author(s):  
MELINDA HERMANTO ◽  
TJOKORDA BAGUS OKA ◽  
I PUTU EKA NILA KENCANA
Keyword(s):  
Computational Geometry ◽  
Facility Location ◽  
Voronoi Diagram ◽  
Location Problem ◽  
Facility Location Problem ◽  
Two Dimensions ◽  
School Development ◽  
Surrounding Area ◽  
Development Problem ◽  
Largest Empty Circle

In school development problem, determining location is one of important things to consider. In this research, the purpose is to determine the location of SMAN 9 Denpasar if it will be built. One of algorithms in computational geometry that can be used to find solution of facility location problem is multiplicatively weighted Voronoi diagram in two dimensions. The result of weighted Voronoi diagram shows the influence of each site to the surrounding area. Then, the location of SMAN 9 Denpasar is obtained by determining the center of the largest empty circle of the weighted Voronoi diagram.

Sign in / Sign up

Export Citation Format

Share Document