Models and local search algorithms for vehicle routing with returns and time windows

DOI10.26516/1997-7670.2024.48.95zbMATH Open1541.90094MaRDI QIDQ6572957FDOQ6572957

Authors: Lidiya Anatol'evna Zaozerskaya, Julia Viktorovna Kovalenko 

Publication date: 16 July 2024

Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Recommendations

• Fast Local Searches For The Vehicle Routing Problem With Time Windows
• Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• A heuristic for the vehicle routing problem with time windows

zbMATH Keywords

modellocal searchinteger programmingvehicle routing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Cites Work

• A library of local search heuristics for the vehicle routing problem
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
• A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem

This page was built for publication: Models and local search algorithms for vehicle routing with returns and time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572957)