An assignment-based heuristic for vehicle routing with time windows

DOI10.1007/s12351-008-0018-2zbMath1154.90340OpenAlexW2037754350MaRDI QIDQ1001380

Gregory P. Prastacos, George Ioannou, Manolis N. Kritikos

Publication date: 17 February 2009

Published in: Operational Research. An International Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12351-008-0018-2

zbMATH Keywords

heuristicsvehicle routingassignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• A New Heuristic for the Traveling Salesman Problem with Time Windows
• The Shortest Path Problem with Time Windows and Linear Waiting Costs
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Vehicle Routing with Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• Sequencing material handling equipment in production facilities