This paper deals with an 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. We investigate the relationship between this problem and its single-period counterpart. We also derive some properties and a special case. The insight gained with this analysis is then used to devise a two-stage 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.

The multi-period p-center problem with time-dependent travel times

Tobia Calogiuri;Gianpaolo Ghiani;Emanuela Guerriero;Emanuele Manni
2019

Abstract

This paper deals with an 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. We investigate the relationship between this problem and its single-period counterpart. We also derive some properties and a special case. The insight gained with this analysis is then used to devise a two-stage 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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11587/434428
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact