Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem
Fleet management plays a central role in several application contexts such as distribution planning, mail delivery, garbage collection, salt gritting, field service routing. Since road congestion has a big impact on driving times, fleet management can be enhanced by taking into account data on curre...
Main Authors: | Tommaso Adamo, Gianpaolo Ghiani, Pierpaolo Greco, Emanuela Guerriero |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10005081/ |
Similar Items
-
Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning
by: Gianpaolo Ghiani, et al.
Published: (2020-12-01) -
Solving the clustered traveling salesman problem via traveling salesman problem methods
by: Yongliang Lu, et al.
Published: (2022-06-01) -
The traveling salesman problem : a computational study /
by: Applegate, David L.
Published: (2007) -
Solving travelling salesman problem using nios processor /
by: 560514 Shaikh Nasir Shaikh Husin, et al.
Published: (2007) -
Solving traveling salesman problem using Nios processor /
by: 461278 Lim, Kai Lin
Published: (2006)