.png){kind=icon}
.png){kind=icon}
Return
Modeling and solving a multi-facility location-relocation problem considering two dynamic probabilistic line barriers
.png){kind=icon}
PRE
AI
S
N
DOI：10.1007/s00500-026-11375-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a multi-facility location problem in the presence of two probabilistic line barriers, where both the demand and the positions of existing facilities, as well as the moving routes of the barriers, have a dynamic nature. The objective is to determine the locations of new facilities on the plane over multiple periods, while relocation decisions in each period depend on the locations obtained in the previous period, so that the total weighted expected rectilinear barrier distance is minimized. A heuristic approach is developed to specify the visibility conditions, and the proposed problem is formulated as a mixed-integer nonlinear programming model. To handle large-scale instances, we provide effective lower and upper bounds and develop two evolutionary algorithms, namely Evolutionary Simulated Annealing (ESA) and Imperialist Competitive Algorithm (ICA). Numerical experiments demonstrate that these algorithms generate high-quality solutions within reasonable computing times. Furthermore, an empirical study is conducted on the temporary location of warehouses in a factory located in the Rajeh industrial zone, Babol, Iran, to illustrate the performance and practical applicability of the proposed model.
Keywords:
Dynamic multi- facility location problem
Two probabilistic line barriers
Dynamic moving routes
Evolutionary solution approaches
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers