Local optimization of routes in vehicle routing problems with time windows

DOI10.1070/RM2009V064N01ABEH004608MaRDI QIDQ3497587zbMATH OpenOpenAlexFDO

Authors S. V. Chernyshev

Publication date 27 July 2009

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/rm2009v064n01abeh004608

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Vehicle Routing with Time Windows: Two Optimization Algorithms
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• scientific article; zbMATH DE number 4047423
• A way to optimally solve a time-dependent vehicle routing problem with time windows

Cited in

(2)

• On the route construction in changing environments using solutions of the eikonal equation
• Recent progress of local search in handling the time window constraints of the vehicle routing problem

This page was built for publication: Local optimization of routes in vehicle routing problems with time windows

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