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 条
  • [21] Waste Collection Vehicle Routing Problem on HPC Infrastructure
    Grakova, Ekaterina
    Slaninova, Katerina
    Martinovic, Jan
    Krenek, Jan
    Hanzelka, Jiri
    Svaton, Vaclav
    [J]. COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT, CISIM 2018, 2018, 11127 : 266 - 278
  • [22] Onsite Medical waste multi-objective vehicle routing problem with time windows
    Hajar, Zkeik
    Btissam, Dkhissi
    Mohamed, Reghioui
    [J]. 2018 4TH IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL), 2018,
  • [23] Waste Collection Vehicle Routing Problem Model with Multiple Trips, Time Windows, Split Delivery, Heterogeneous Fleet and Intermediate Facility
    Nurprihatin, Filscha
    Lestari, Anggun
    [J]. ENGINEERING JOURNAL-THAILAND, 2020, 24 (05): : 55 - 64
  • [24] Developing an applied algorithm for multi-trip vehicle routing problem with time windows in urban waste collection: A case study
    Tirkolaee, Erfan Babaee
    Abbasian, Parvin
    Soltani, Mehdi
    Ghaffarian, Seyed Ali
    [J]. WASTE MANAGEMENT & RESEARCH, 2019, 37 (1_suppl) : 4 - 13
  • [25] The cumulative vehicle routing problem with arc time windows
    Kritikos, Manolis N.
    Metzidakis, Theocharis
    Ioannou, George
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2024, 240
  • [26] Lagrangian Relaxation for the Vehicle Routing Problem with time windows
    Aggarwal, Divya
    Kumar, Vijay
    Girdhar, Ashish
    [J]. 2017 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING, INSTRUMENTATION AND CONTROL TECHNOLOGIES (ICICICT), 2017, : 1601 - 1606
  • [27] A hybrid algorithm for the Vehicle Routing Problem with Time Windows
    Ribas, Sabir
    Subramanian, Anand
    Coelho, Igor Machado
    Ochi, Luiz Satoru
    Freitas Souza, Marcone Jamilson
    [J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1243 - 1252
  • [28] Vehicle routing problem with drones considering time windows
    Kuo, R. J.
    Lu, Shih-Hao
    Lai, Pei-Yu
    Mara, Setyo Tri Windras
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [29] A hybrid algorithm for vehicle routing problem with time windows
    Yu, B.
    Yang, Z. Z.
    Yao, B. Z.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (01) : 435 - 441
  • [30] Disruption management for the vehicle routing problem with time windows
    Zhang, Xiaoxia
    Tang, Lixin
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 225 - +