A classification scheme for vehicle routing and scheduling problems

DOI10.1016/0377-2217(90)90007-XzbMath0699.90053MaRDI QIDQ913648

Savelsbergh, Martin W. P., Martin Desrochers, Jan Karel Lenstra

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

classification; vehicle routing

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Heuristics from Nature for Hard Combinatorial Optimization Problems, An approximation algorithm for the pickup and delivery vehicle routing problem on trees, Polyhedral results for a vehicle routing problem, The vehicle routing problem: An overview of exact and approximate algorithms, A heuristic algorithm for solving hazardous materials distribution problems., The split delivery vehicle scheduling problem with time windows and grid network distances, Routing problems: A bibliography, A dial-a-ride problem for client transportation in a health-care organization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Truck Dispatching Problem
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• The period routing problem
• Routing with time windows by column generation
• Computer-Aided complexity classification of combinational problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey