In this paper we study a property of time-dependent graphs, dubbed "path ranking invariance''. Broadly speaking, a time-dependent graph is "path ranking invariant'' if the ordering of its paths (w.r.t. travel time) is independent of the start time. In this paper we show that, if a graph is path ranking invariant, the solution of a large class of time-dependent vehicle routing problems can be obtained by solving suitably defined (and simpler) time-independent routing problems. We also show how this property can be checked by solving a linear program. If the check fails, the solution of the linear program can be used to determine a tight lower bound. In order to assess the value of these insights, the lower bounds have been embedded into an enumerative scheme. Computational results on the time-dependent versions of the extit{Travelling Salesman Problem} and the extit{Rural Postman Problem} show that the new findings allow to outperform state-of-the-art algorithms.

On path ranking in time-dependent graphs

Tommaso Adamo;Gianpaolo Ghiani;Emanuela Guerriero
2020

Abstract

In this paper we study a property of time-dependent graphs, dubbed "path ranking invariance''. Broadly speaking, a time-dependent graph is "path ranking invariant'' if the ordering of its paths (w.r.t. travel time) is independent of the start time. In this paper we show that, if a graph is path ranking invariant, the solution of a large class of time-dependent vehicle routing problems can be obtained by solving suitably defined (and simpler) time-independent routing problems. We also show how this property can be checked by solving a linear program. If the check fails, the solution of the linear program can be used to determine a tight lower bound. In order to assess the value of these insights, the lower bounds have been embedded into an enumerative scheme. Computational results on the time-dependent versions of the extit{Travelling Salesman Problem} and the extit{Rural Postman Problem} show that the new findings allow to outperform state-of-the-art algorithms.
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/443517
 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