Article
Management
Allyson Silva, Daniel Aloise, Leandro C. Coelho, Caroline Rocha
Summary: This study focuses on the Dynamic Facility Location Problem with Modular Capacities (DFLPM), using tailored heuristics to find optimal solutions under various scenarios and cost structures. Experimental results show that different heuristics perform differently depending on the characteristics of the instance being solved. Practitioners can choose the most suitable method based on the specific situation to achieve better results.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Tue Rauff Lind Christensen, Andreas Klose
Summary: This paper proposes an exact method for the capacitated facility location problem with convex and differentiable production costs functions, which deals directly with nonlinear costs using Lagrangian relaxation and subgradient optimization. By applying this method to a branch and bound algorithm, proven optimal solutions are found, showing superior performance compared to other solution methods for this problem in most cases.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Dieter Weninger, Laurence A. W. Olsey
Summary: This paper studies the capacitated facility location problem with (partial) single-sourcing (CFLP-SS). A natural mixed integer formulation for the problem is proposed, and three variants of a Benders' type decomposition algorithm are presented. Computational comparisons are made with a commercial solver (CPLEX) on the original formulation, a CPLEX version of Benders, and a cut-and-solve approach developed specifically for CFLP-SS. The results show that the Benders' variants achieve speedups of between 1.2 and 3.7 for CFLP-SS when the percentage of clients requiring single-sourcing is less than or equal to 25%.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
C. Filippi, G. Guastaroba, D. L. Huerta-Munoz, M. G. Speranza
Summary: This study addresses a Fair Facility Location Problem by minimizing the conditional beta-mean to balance system efficiency and fair treatment of users. A heuristic framework based on Kernel Search is proposed to solve the problem, with computational experiments validating the high-quality solutions produced by the framework.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Runze Zhao, Yiyong Xiao, Rui Luo, Ruiyi Yang, Shenghan Zhou, Siyue Zhang
Summary: This study develops a mathematical model based on MILP for the facility location problem. A greedy multiphase location method and a two-variable-based dynamic iterative partial optimization method are proposed to find the locations of new facilities. Experimental results show that MPL-MILP is suitable for small and medium-sized problems, while TVB-DIPO is more efficient for large-scale problems.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Computer Science, Interdisciplinary Applications
Yujing Zheng, Yuxiong Ji, Yu Shen, Bing Liu, Yuchuan Du
Summary: This study proposes a hub-and-spoke network with capacity depending on the incentive provided to transporters. A customized outer-approximation algorithm is developed for solving a difficult mixed integer convex programming model, and an approximation algorithm is also developed to provide suboptimal solutions. Experimental results confirm the effectiveness of the proposed network and algorithms.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Management
Beste Basciftci, Shabbir Ahmed, Siqian Shen
Summary: This paper discusses a distributionally robust facility location problem, highlighting the significant impact of facility location decisions on customer demand. The proposed decision-dependent distributionally robust optimization model demonstrates superior performance in profit and service quality across different scenarios.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Karmel S. Shehadeh, Ece Sanci
Summary: This paper considers a decision-maker who needs to determine a subset of locations to open facilities from a set of candidate sites and assign customer demand accordingly. The study focuses on a new setting where customer demand is bimodal, with two spatially distinct probability distributions. By constructing a scenario-wise ambiguity set and formulating a distributionally robust facility location model, the study seeks to minimize costs while considering the ambiguity and multimodality of demand distributions in strategic real-world problems.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Economics
Mingyang Pei, Peiqun Lin, Jun Du, Xiaopeng Li, Zhiwei Chen
Summary: Modular vehicle technology allows flexible adjustments of vehicle capacity to meet passenger demand, and the proposed modular transit network system concept aims to address issues in traditional public transportation systems. By developing a mixed-integer nonlinear programming model, the optimal MTNS design is achieved, and its effectiveness is demonstrated through numerical examples.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Operations Research & Management Science
Yun Hui Lin, Qingyun Tian
Summary: We studied a variant of the competitive facility location problem and proposed exact solution approaches by introducing a gravity-based rule and a multi-ratio linear fractional 0-1 program. Computational experiments on randomly generated datasets showed that the mixed-integer quadratic conic approach outperforms others in terms of computational time.
OPTIMIZATION LETTERS
(2021)
Article
Operations Research & Management Science
Roberto Baldacci, Marco Caserta, Emiliano Traversi, Roberto Wolfler Calvo
Summary: We investigate the properties of robust solutions for the Capacitated Facility Location Problem with uncertain demand and find that the relationship between robustness and price is not always monotonous. We also demonstrate the validity of our findings through computational experiments on benchmark instances and real-world applications.
OPTIMIZATION LETTERS
(2022)
Article
Management
Mingyao Qi, Ruiwei Jiang, Siqian Shen
Summary: This study investigates a competitive facility location problem in which two firms open new facilities within their budgets to maximize their market shares. The problem is formulated as a bilevel mixed-integer nonlinear program and is solved using an exact algorithm and an approximation algorithm. Several extensions and solution approaches are considered. Numerical studies demonstrate the effectiveness of the algorithms, and managerial insights are derived from sensitivity analysis.
OPERATIONS RESEARCH
(2022)
Article
Management
Oscar F. Carrasco Heine, Antonia Demleitner, Jannik Matuschke
Summary: This paper presents an approximation algorithm for the capacitated version of the location routing problem. By introducing a bifactor approximation, the algorithm can find approximate solutions within a small fraction beyond the facility capacity while approximating the optimal cost by a constant factor. In addition, a comprehensive computational study shows that the algorithm outperforms current state-of-the-art heuristics in terms of efficiency.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Construction & Building Technology
Trevor Betz, Khaled El-Rayes, Michael Grussing, Louis Bartels
Summary: Maintenance planning of civil infrastructure is complex due to uncertainty and budgeting difficulties. This paper proposes a novel methodology that integrates Markov chain Monte Carlo process and mixed integer programming model to optimize repair planning under uncertainty. The proposed method outperforms non-linear approaches in terms of computational time and consistently meeting a facility health metric at a minimal cost. A case study using data from the U.S. Army Corps of Engineers demonstrates the feasibility of the proposed approach for building infrastructure maintenance.
JOURNAL OF BUILDING ENGINEERING
(2023)
Review
Computer Science, Interdisciplinary Applications
Eduardo Alarcon-Gerbier, Udo Buscher
Summary: Supply chain planning is typically based on fixed production locations. However, with the development of new technologies and modularization, mobile and modular units have emerged that can change locations quickly and at a low cost. This has generated interest in studying more flexible network positioning. By reviewing and classifying 125 research papers, this study provides a comprehensive overview of mathematical formulations, solution approaches, objectives, and main characteristics. Additionally, case studies presented in the literature are categorized and research trends for further development in this field are identified.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)