Article
Computer Science, Artificial Intelligence
Xinping Xu, Bo Li, Minming Li, Lingjie Duan
Summary: The study focuses on the mechanism design problem of locating two facilities on a line interval, considering the requirement of a minimum distance between the facilities. The research provides solutions for both heterogeneous and homogeneous facility scenarios, showing that optimal solutions can be computed efficiently in the former case, while any deterministic strategyproof mechanism has unbounded approximation ratio in the latter case.
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Xinping Xu, Jingwen Zhang, Lihua Xie
Summary: We study the optional preference model for the facility location game with two heterogeneous facilities on a line interval, by enforcing the requirement of a minimum distance between the two facilities. We aim to design a mechanism that minimizes the maximum cost of agents and achieves truthful report of agents' preferences.
JOURNAL OF COMBINATORIAL OPTIMIZATION
(2023)
Article
Transportation Science & Technology
Tengkuo Zhu, Stephen D. Boyles, Avinash Unnikrishnan
Summary: This paper discusses a short-term post-disaster UAV humanitarian relief application, considering demand uncertainty using demand scenarios. It proposes a location-allocation plan with minimal cost and compares the performance of different models.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2022)
Proceedings Paper
Computer Science, Interdisciplinary Applications
Ling Gai, Dandan Qian, Chenchen Wu
Summary: This paper considers the game of locating two homogeneous facilities in the interval [0, 1] with a maximum distance requirement. It designs mechanisms to output the locations of the facilities based on the preferred locations reported by agents, aiming to maximize the total utility or minimize the total cost. The privacy of agents' location information may lead to misreporting to influence the output. The paper proves that there is no deterministic strategy-proof mechanism that can achieve a constant approximation ratio for the desirable facilities case. It then proposes four group strategy-proof mechanisms and proves their approximation ratios for the obnoxious facilities case. The performance of the mechanisms is compared under different maximum distance requirements.
FRONTIERS OF ALGORITHMIC WISDOM, IJTCS-FAW 2022
(2022)
Article
Mathematics, Applied
Yunfei Su, Xiaoshan Kai
Summary: Cyclic codes with two zeros and length n=q(m-1)/r are explored in this study. A necessary and sufficient condition with minimum distance two is provided for such cyclic codes. It is proven that these cyclic codes have a minimum distance of at most three when q>2r+1. An optimal family of cyclic codes with parameters [2(q(m)-1)/q-1, 2(q(m)- 1)/ q-1 - 2m, 4] is obtained for the case of r=q-1/2.
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
(2023)
Article
Computer Science, Artificial Intelligence
Mariano Vargas-Santiago, Raul Monroy, Chi Zhang, Jose E. Ramirez-Marquez, Diana A. Leon-Velasco
Summary: Facility Location is a multi-objective optimization problem aiming to minimize costs while satisfying overall demand. Current techniques do not consider existing configurations or environmental changes, so we introduce the adaptable Pareto set. Our experiments show that our heuristics are competitive and video game players may obtain better solutions.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Engineering, Industrial
Esra Koca, Nilay Noyan, Hande Yaman
Summary: This study introduces a new class of two-stage stochastic uncapacitated facility location problems under system nervousness considerations and proposes a solution using restricted recourse two-stage stochastic programming models. The results show the effectiveness of this approach in solving the problems of interest.
Article
Computer Science, Artificial Intelligence
Gabriel Souto, Igor Morais, Geraldo Regis Mauri, Glaydston Mattos Ribeiro, Pedro Henrique Gonzalez
Summary: The Two-Stage Capacitated Facility Location (TSCFL) problem aims to minimize operational costs in the supply chain by finding optimal factory and warehouse locations. A hybrid method combining Clustering Search, Adaptive Large Neighborhood Search, and Local Branching has shown to outperform current state-of-art solutions in computational experiments.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Economics
B. Amelia Pludow, Alan T. Murray, Richard L. Church
Summary: This paper uses location analytics to support system reassessment and planning, presenting a case study focused on wireless Internet access in a university campus. The results indicate that system history and decision-making processes impact the level of wireless service access, and planning efforts focused on optimal system reconfiguration can significantly enhance service quality.
SOCIO-ECONOMIC PLANNING SCIENCES
(2022)
Article
Multidisciplinary Sciences
Unanaowo Nyong Bassey, Samuel Chiabom Zelibe
Summary: This study presents a new model for a two-echelon location-inventory system with response time constraints, focusing on the incorporation of lateral transshipment. By using a continuous-time Markov process approach and formulating a mixed integer nonlinear programming model, the study minimizes total system cost and determines optimal service facility locations and quantities, as well as customer allocations.
Article
Computer Science, Information Systems
Huizhen Zhang, Kun Zhang, Yuting Chen, Liang Ma
Summary: This paper studies a two-level medical facility location problem with multiple patient flows and proposes a solution approach that is validated using a real case.
INFORMATION SCIENCES
(2022)
Article
Mathematics
Alejandro Moya-Martinez, Mercedes Landete, Juan Francisco Monge
Summary: This paper introduces the concept of "close-enough" in facility location, exploring the optimal solution for selecting facilities and pickup points among finite candidate sets to satisfy all demand and minimize total cost.
Article
Computer Science, Interdisciplinary Applications
Tianqi Liu, Guiyu Li
Summary: This study proposes a structured paradigm of finitely adaptive distributionally robust optimization to tackle the unobservability and ambiguity of feedstock condition. Experimental results demonstrate the effectiveness of the approach in mitigating unobservability and ambiguity effects in recycling planning, and the scalability advantage suggests potential applications in other areas.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Management
Chun Cheng, Yossiri Adulyasak, Louis-Martin Rousseau
Summary: Facility location decision is strategic and should consider uncertainties; Solutions to fixed charge location problems and facility fortification problems were studied and compared; Experimental results show that robust models can better handle problems under uncertainties, assisting managers in making more informed decisions.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
(2021)
Article
Management
Robert Aboolian, Oded Berman, Dmitry Krass
Summary: The paper introduces a generalized framework and methodology for optimizing both location and design decisions for multiple facilities simultaneously. Research results demonstrate that combining design and location decisions can lead to better optimization outcomes, while not combining them may result in significant optimality gaps.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)