Learn global and optimize local: a data-driven methodology for last-mile routing

DOI10.1016/j.cor.2023.106312arXiv2112.01937OpenAlexW4380758673MaRDI QIDQ6047849

Mayukh Ghosh, Donato Maragno, Alex Kuiper, Roshan Mahes

Publication date: 13 September 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.01937

zbMATH Keywords

navigationtraveling salesman problemroute predictiondata-driven optimizationlast-mile logistics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Adaptive appointment scheduling with periodic updates

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• The Euclidean traveling salesman problem is NP-complete
• Heuristics for the traveling salesman problem with pickup and delivery
• Divide and conquer strategies for parallel TSP heuristics
• A survey on matheuristics for routing problems
• The Truck Dispatching Problem
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• Integer Programming Formulation of Traveling Salesman Problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• The Covering Salesman Problem
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• The Traveling-Salesman Problem

This page was built for publication: Learn global and optimize local: a data-driven methodology for last-mile routing