Vehicle routing-scheduling for waste collection in Hanoi
From MaRDI portal
Publication:1582030
DOI10.1016/S0377-2217(99)00408-7zbMath0967.90020OpenAlexW2110330194MaRDI QIDQ1582030
Publication date: 3 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00408-7
Transportation, logistics and supply chain management (90B06) Reliability, availability, maintenance, inspection in operations research (90B25) Traffic problems in operations research (90B20)
Related Items (10)
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 ⋮ An optimal path planning problem for heterogeneous multi-vehicle systems ⋮ A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem ⋮ Metaheuristics with disposal facility positioning for the waste collection VRP with time windows ⋮ Optimizing high-level nuclear waste disposal within a deep geologic repository ⋮ A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system ⋮ Vehicle routing problems with multiple trips ⋮ Vehicle routing problems with multiple trips ⋮ Waste collection vehicle routing problem with time windows ⋮ A stochastic inventory routing problem for infectious medical waste collection
Uses Software
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
This page was built for publication: Vehicle routing-scheduling for waste collection in Hanoi