The multi-period p-center problem with time-dependent travel times
share
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.
READ FULL TEXT