Garbage collection in Chicago: a dynamic scheduling model
Management Science
The vehicle routing problem
Routing Optimization for Waste Management
Interfaces
Computers and Industrial Engineering
A search space analysis for the waste collection vehicle routing problem with time windows
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Computers and Operations Research
Engineering Applications of Artificial Intelligence
Journal of Mathematical Modelling and Algorithms
Solving vehicle routing problems using an enhanced clarke-wright algorithm: a case study
ICCL'12 Proceedings of the Third international conference on Computational Logistics
An insertion heuristic manpower scheduling for in-flight catering service application
ICCL'12 Proceedings of the Third international conference on Computational Logistics
Multiple agents maximum collection problem with time dependent rewards
Computers and Industrial Engineering
A memetic algorithm for the travelling salesperson problem with hotel selection
Computers and Operations Research
A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
Computers and Operations Research
A memetic algorithm for waste collection vehicle routing problem with time windows and conflicts
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
Hi-index | 0.01 |
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch breaks. Solomon's well-known insertion algorithm is extended for the problem. While minimizing the number of vehicles and total traveling time is the major objective of vehicle routing problems in the literature, here we also consider the route compactness and workload balancing of a solution since they are very important aspects in practical applications. In order to improve the route compactness and workload balancing, a capacitated clustering-based waste collection VRPTW algorithm is developed. The proposed algorithms have been successfully implemented and deployed for the real life waste collection problems at Waste Management, Inc. A set of waste collection VRPTW benchmark problems is also presented in this paper.Waste collection problems are frequently considered as arc routing problems without time windows. However, that point of view can be applied only to residential waste collection problems. In the waste collection industry, there are three major areas: commercial waste collection, residential waste collection and roll-on-roll-off. In this paper, we mainly focus on the commercial waste collection problem. The problem can be characterized as a variant of VRPTW since commercial waste collection stops may have time windows. The major variation from a standard VRPTW is due to disposal operations and driver's lunch break. When a vehicle is full, it needs to go to one of the disposal facilities (landfill or transfer station). Each vehicle can, and typically does, make multiple disposal trips per day. The purpose of this paper is to introduce the waste collection VRPTW, benchmark problem sets, and a solution approach for the problem. The proposed algorithms have been successfully implemented and deployed for the real life waste collection problems of Waste Management, the leading provider of comprehensive waste management services in North America with nearly 26,000 collection and transfer vehicles.