Garbage collection in Chicago: a dynamic scheduling model
Management Science
Computers and Operations Research
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
The Rollon--Rolloff Vehicle Routing Problem
Transportation Science
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Routing Optimization for Waste Management
Interfaces
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Waste collection vehicle routing problem with time windows
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
Improved route planning and scheduling of waste collection and transport
Expert Systems with Applications: An International Journal
Computers and Operations Research
| Hi-index | 0.01 |
This paper discusses the rollon-rolloff vehicle routing problem, a sanitation routing problem in which large containers are left at customer locations such as construction sites and shopping centers. Customers dump their garbage into large waste containers and request for waste treatment services. Tractors then transport a container at a time between customer locations, disposal facility, and depot. The objective of the problem is to determine routes that minimize the number of required tractors and their deadhead time to serve all given customer demands. We propose a hybrid metaheuristic approach that consists of a large neighborhood search and various improvement methods to solve the problem. The effectiveness of the proposed approach is demonstrated by computational experiments using benchmark data. New best-known solutions are found for 17 problems out of 20 benchmark instances.