Vehicle routing-scheduling for waste collection in Hanoi

DOI10.1016/S0377-2217(99)00408-7zbMath0967.90020MaRDI QIDQ1582030

Dang Vu Tung, Anulark Pinnoi

Publication date: 3 September 2001

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

zbMATH Keywords

heuristics; transportation; time windows; routing

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B25: Reliability, availability, maintenance, inspection in operations research

90B20: Traffic problems in operations research

Related Items

Waste collection vehicle routing problem with time windows

Uses Software

• VRP

Cites Work

• Unnamed Item
• Vehicles scheduling with sliding time windows
• The traveling salesman problem: An overview of exact and approximate algorithms
• A tabu search heuristic for the multi-depot vehicle routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Exchange Heuristic for Routeing Problems with Time Windows