Routing relatively few customers per route

DOI10.1007/BF02579048zbMath1079.90018MaRDI QIDQ1876468

Olli Bräysy, Wout E. H. Dullaert

Publication date: 7 September 2004

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

heuristicstime windowsvehicle routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A threshold accepting metaheuristic for the vehicle routing problem with time windows.
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Tabu search heuristics for the vehicle routing problem with time windows.
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
• New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Comparing descent heuristics and metaheuristics for the vehicle routing problem

This page was built for publication: Routing relatively few customers per route