This paper deals with a multi-period extension of the p-center problem, in which arc traversal times vary over time, and facilities are mobile units that can be relocated multiple times during the planning horizon. The problem arises in several applications, such as emergency services, in which vehicles can be relocated in anticipation of traffic congestion. First, we analyze the problem structure and its relationship with its single-period counterpart, considered as a special case. Then, the insight gained with this analysis is used to devise a decomposition heuristic. Computational results on instances based on the Paris (France) road graph indicate that the algorithm is capable of determining good-quality solutions in a reasonable execution time.
https://doi.org/10.1016/j.cor.2021.105487Cite as:
@article{Calogiuri_2021,
doi = {10.1016/j.cor.2021.105487},
url = {https://doi.org/10.1016%2Fj.cor.2021.105487},
year = 2021,
month = {dec},
publisher = {Elsevier {BV}},
volume = {136},
pages = {105487},
author = {Tobia Calogiuri and Gianpaolo Ghiani and Emanuela Guerriero and Emanuele Manni},
title = {The multi-period $less$mml:math xmlns:mml="http://www.w3.org/1998/Math/{MathML}" display="inline" id="d1e768" altimg="si607.svg"$greater$$less$mml:mi$greater$p$less$/mml:mi$greater$$less$/mml:math$greater$-center problem with time-dependent travel times},
journal = {Computers {&}amp$mathsemicolon$ Operations Research}
}