On path ranking in time-dependent graphs

09/16/2020
by   Tommaso Adamo, et al.
0

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 Travelling Salesman Problem and the Rural Postman Problem show that the new findings allow to outperform state-of-the-art algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2020

Arc Routing with Time-Dependent Travel Times and Paths

Vehicle routing algorithms usually reformulate the road network into a c...
research
07/28/2021

Learned upper bounds for the Time-Dependent Travelling Salesman Problem

Given a graph whose arc traversal times vary over time, the Time-Depende...
research
08/11/2020

Scheduling activities with time-dependent durations and resource consumptions

In this paper we study time-dependent scheduling problems where activiti...
research
01/06/2021

On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks

A weighted point-availability time-dependent network is a list of tempor...
research
04/20/2018

Modelling the Time-dependent VRP through Open Data

This paper presents an open data approach to model and solve the vehicle...
research
06/14/2019

Quantitative Comparison of Time-Dependent Treemaps

Rectangular treemaps are often the method of choice for visualizing larg...
research
05/03/2022

Learning Label Initialization for Time-Dependent Harmonic Extension

Node classification on graphs can be formulated as the Dirichlet problem...

Please sign up or login with your details

Forgot password? Click here to reset