The rollon–rolloff waste collection vehicle routing problem with time windows |
| |
Authors: | Juyoung Wy Byung-In Kim Seongbae Kim |
| |
Institution: | 1. Department of Industrial and Management Engineering, Pohang University of Science and Technology (POSTECH), Pohang, Kyungbuk 790-784, Republic of Korea;2. WMLogistics, 5910 FM 1488, Magnolia, TX 77354, USA |
| |
Abstract: | This study introduces a rollon–rolloff waste collection vehicle routing problem involving large containers that accumulate huge amounts of garbage at construction sites and shopping districts. In this problem, tractors move one container at a time between customer locations, a depot, disposal facilities, and container storage yards. The complicated constraints discussed in this study arise from having multiple disposal facilities, multiple container storage yards, seven service types of customer demands, different time windows for customer demands and facilities, various types and sizes of containers, and the lunch break of tractor drivers. In addition, real-world issues, such as changing service types, multiple demands at a customer’s location, and tractors with different work schedules, are dealt with. This study proposes a large neighborhood search based iterative heuristic approach consisting of several algorithms for the problem. The effectiveness of the proposed methods is demonstrated by computational experiments using benchmark data, some instances of which are derived from real-world problems. |
| |
Keywords: | Routing Rollon&ndash rolloff Waste collection Skip collection problem Large neighborhood search Heuristics |
本文献已被 ScienceDirect 等数据库收录! |
|