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 条
  • [1] An ILS Heuristic for the Waste Collection Vehicle Routing Problem with Time Windows
    Campos, Alba A.
    Arroyo, Jose Elias C.
    [J]. INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2016), 2017, 557 : 889 - 899
  • [2] The waste collection vehicle routing problem with time windows in a city logistics context
    Buhrkal, Katja
    Larsen, Allan
    Ropke, Stefan
    [J]. SEVENTH INTERNATIONAL CONFERENCE ON CITY LOGISTICS, 2012, 39 : 241 - 254
  • [3] A Memetic Algorithm for Waste Collection Vehicle Routing Problem with Time Windows and Conflicts
    Thai Tieu Minh
    Tran Van Hoai
    Tran Thi Nhu Nguyet
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, PT I, 2013, 7971 : 485 - 499
  • [4] The rollon-rolloff waste collection vehicle routing problem with time windows
    Wy, Juyoung
    Kim, Byung-In
    Kim, Seongbae
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 224 (03) : 466 - 476
  • [6] Optimization of reliable vehicle routing problem for medical waste collection with time windows in stochastic transportation networks
    Xu, Xiang
    Wu, Ting
    Wang, Sirui
    Zhang, Sihan
    Xu, Zheyu
    Yang, Bainan
    Ding, Ziyang
    Shen, Liang
    [J]. ENGINEERING OPTIMIZATION, 2024,
  • [7] The vehicle routing problem with time windows
    Li, GL
    Zhu, XL
    [J]. PROGRESS IN INTELLIGENCE COMPUTATION & APPLICATIONS, 2005, : 236 - 240
  • [8] Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
    Benjamin, A. M.
    Beasley, J. E.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) : 2270 - 2280
  • [9] Capacitated Vehicle Routing Problem with Time Windows
    Tanel, Aleyna
    Kinay, Begum
    Karakul, Deniz
    Ozyoruk, Efecan
    Iskifoglu, Elif
    Ozogul, Ezgi
    Ustaoglu, Meryem
    Yuksel, Damla
    Ornek, Mustafa Arslan
    [J]. DIGITIZING PRODUCTION SYSTEMS, ISPR2021, 2022, : 653 - 664
  • [10] The vehicle routing problem with coupled time windows
    Fügenschuh A.
    [J]. Central European Journal of Operations Research, 2006, 14 (2) : 157 - 176