Variable neighborhood descent for solving the vehicle routing problem with time windows

DOI10.1016/j.endm.2017.03.023zbMath1387.90218OpenAlexW2606491916MaRDI QIDQ1687673

Saoussen Krichen, Marwa Harzi

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.023

zbMATH Keywords

transportationcombinatorial optimizationVRPTWVND

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
• Solve the vehicle routing problem with time windows via a genetic algorithm
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

This page was built for publication: Variable neighborhood descent for solving the vehicle routing problem with time windows