Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach

The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several fields, such as logistics and telecommunication networks. While the existing literature primarily focuses on the deterministic version of the problem, re...

Full description

Saved in:
Bibliographic Details
Published inApplied intelligence (Dordrecht, Netherlands) Vol. 54; no. 7; pp. 5617 - 5638
Main Authors Peidro, David, Martin, Xabier A., Panadero, Javier, Juan, Angel A.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.04.2024
Springer Nature B.V
Subjects
Algorithms
Artificial Intelligence
Combinatorial analysis
Computer Science
Costs
Customer services
Heuristic methods
Linear programming
Logistics
Machines
Manufacturing
Mechanical Engineering
Optimization
Processes
Random variables
Simulation
Supply chains
Tabu search
Uncertainty
Uncertainty
Facility location problem
Tabu search
Simheuristics
Path-relinking
Online AccessGet full text

Cover

More Information
Summary:The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several fields, such as logistics and telecommunication networks. While the existing literature primarily focuses on the deterministic version of the problem, real-life scenarios often involve uncertainties like fluctuating customer demands or service costs. This paper presents a novel algorithm for addressing the UFLP under uncertainty. Our approach combines a tabu search metaheuristic with path-relinking to obtain near-optimal solutions in short computational times for the determinisitic version of the problem. The algorithm is further enhanced by integrating it with simulation techniques to solve the UFLP with random service costs. A set of computational experiments is run to illustrate the effectiveness of the solving method.
ISSN:0924-669X
1573-7497
DOI:10.1007/s10489-024-05441-x