A Data-thrifty Approach to Routing Optimization

Thomas Fayolle, Renaud De Landtsheer, Gustavo Ospina, Fabian Germeau

2021

Abstract

Solving a routing optimisation problem often requires to know the travel times between each pair of points of the problem. Usually, when solving a routing optimisation problem, the travel time is assumed to be constant. However, in real life problems, it can vary a lot due to traffic jams, especially near big cities. Some map data providers can provide accurate travel time estimations, but the data are expensive and querying such a data provider is time consuming. In this paper, we present a method to solve the Pickup and Delivery Problem with Time Windows (PDPTW) that reduces the number of calls to paid data providers while preserving the quality of the solution.

Paper Citation

in Harvard Style

Fayolle T., De Landtsheer R., Ospina G. and Germeau F. (2021). A Data-thrifty Approach to Routing Optimization.In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-485-5, pages 433-437. DOI: 10.5220/0010308504330437

in Bibtex Style

@conference{icores21,
author={Thomas Fayolle and Renaud De Landtsheer and Gustavo Ospina and Fabian Germeau},
title={A Data-thrifty Approach to Routing Optimization},
booktitle={Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2021},
pages={433-437},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010308504330437},
isbn={978-989-758-485-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Data-thrifty Approach to Routing Optimization
SN - 978-989-758-485-5
AU - Fayolle T.
AU - De Landtsheer R.
AU - Ospina G.
AU - Germeau F.
PY - 2021
SP - 433
EP - 437
DO - 10.5220/0010308504330437