Waste collection vehicle routing problem with time windows

被引:252
|
作者
Kim, Byung-In [1 ]
Kim, Seongbae
Sahoo, Surya
机构
[1] POSTECH, Dept Ind & Management Engn, Pohang 790784, Kyungbuk, South Korea
[2] Inst Informat Technol Inc, The Woodlands, TX 77380 USA
关键词
waste collection; vehicle routing problems with time windows; capacitated clustering;
D O I
10.1016/j.cor.2005.02.045
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:3624 / 3642
页数:19
相关论文
共 50 条
  • [31] Agents Toward Vehicle Routing Problem With Time Windows
    Kalina, Petr
    Vokrinek, Jiri
    Marik, Vladimir
    JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2015, 19 (01) : 3 - 17
  • [32] Disruption management for the vehicle routing problem with time windows
    Zhang, Xiaoxia
    Tang, Lixin
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 225 - +
  • [33] A hybrid algorithm for vehicle routing problem with time windows
    Yu, B.
    Yang, Z. Z.
    Yao, B. Z.
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (01) : 435 - 441
  • [34] Vehicle routing problem with drones considering time windows
    Kuo, R. J.
    Lu, Shih-Hao
    Lai, Pei-Yu
    Mara, Setyo Tri Windras
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [35] Graph Sparsification for the Vehicle Routing Problem with Time Windows
    Doppstadt, Christian
    Schneider, Michael
    Stenger, Andreas
    Sand, Bastian
    Vigo, Daniele
    Schwind, Michael
    OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 227 - 232
  • [36] Vehicle routing problem with a heterogeneous fleet and time windows
    Jiang, Jun
    Ng, Kien Ming
    Poh, Kim Leng
    Teo, Kwong Meng
    EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (08) : 3748 - 3760
  • [37] A Transgenic Algorithm for the Vehicle Routing Problem with Time Windows
    Ruiz-Vanoye, Jorge A.
    Diaz-Parra, Ocotlan
    Cocon, Felipe
    Buenabad-Arias, Angeles
    Canepa Saenz, Ana
    PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 138 - 143
  • [38] Evolutionary algorithms for the vehicle routing problem with time windows
    Bräysy, O
    Dullaert, W
    Gendreau, M
    JOURNAL OF HEURISTICS, 2004, 10 (06) : 587 - 611
  • [39] Vehicle routing problem with drones considering time windows
    Kuo, R.J.
    Lu, Shih-Hao
    Lai, Pei-Yu
    Mara, Setyo Tri Windras
    Expert Systems with Applications, 2022, 191
  • [40] CLUSTERING ALGORITHM FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
    Thi Diem Chau Le
    Duc Duy Nguyen
    Olah, Judit
    Pakurar, Miklos
    TRANSPORT, 2022, 37 (01) : 17 - 27