An iterated local search algorithm for latency vehicle routing problems with multiple depots

DOI10.1016/j.cor.2023.106293OpenAlexW4378976767MaRDI QIDQ6106601

John Willmer Escobar, Unnamed Author, Paolo Toth

Publication date: 3 July 2023

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

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106293

zbMATH Keywords

latencycumulative routingLLRPilsMD\(k\)-TRPMDCCVRP

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• The latency location-routing problem
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Two improved formulations for the minimum latency problem
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• The multi-depot \(k\)-traveling repairman problem
• New formulations and solution approaches for the latency location routing problem
• A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• Routing multiple work teams to minimize latency in post-disaster road network restoration
• The minimum latency problem
• Special cases of traveling salesman and repairman problems with time windows
• The Delivery Man Problem and Cumulative Matroids
• The k -traveling repairmen problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Effective metaheuristics for the latency location routing problem

This page was built for publication: An iterated local search algorithm for latency vehicle routing problems with multiple depots