Open Access System for Information Sharing

Login Library

 

Article
Cited 253 time in webofscience Cited 308 time in scopus
Metadata Downloads

Waste collection vehicle routing problem with time windows SCIE SCOPUS

Title
Waste collection vehicle routing problem with time windows
Authors
Kim, BIKim, SSahoo, S
Date Issued
2006-12
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Abstract
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. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords
waste collection; vehicle routing problems with time windows; capacitated clustering; ALGORITHM; MODEL; GIS
URI
https://oasis.postech.ac.kr/handle/2014.oak/23958
DOI
10.1016/j.cor.2005.02.045
ISSN
0305-0548
Article Type
Article
Citation
COMPUTERS & OPERATIONS RESEARCH, vol. 33, no. 12, page. 3624 - 3642, 2006-12
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

김병인KIM, BYUNG IN
Dept. of Industrial & Management Eng.
Read more

Views & Downloads

Browse