Fast Local Searches For The Vehicle Routing Problem With Time Windows

DOI10.1080/03155986.2002.11732660MaRDI QIDQ5888262zbMATH OpenOpenAlexFDO

Authors Olli Bräysy

Publication date 24 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2002.11732660

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
• A heuristic for the vehicle routing problem with time windows
• A multi-start local search algorithm for the vehicle routing problem with time windows
• scientific article; zbMATH DE number 2118477
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search

Cited in

(6)

• Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• scientific article; zbMATH DE number 2118477 (Why is no real title available?)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows
• Models and local search algorithms for vehicle routing with returns and time windows

This page was built for publication: Fast Local Searches For The Vehicle Routing Problem With Time Windows

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