Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study

被引:36
作者
Carlos Molina, Jose [1 ]
Eguia, Ignacio [1 ]
Racero, Jesus [1 ]
机构
[1] Univ Seville, Escuela Super Ingn, Camino Descubrimientos S-N, Seville 41092, Spain
关键词
Waste collection vehicle routing problem; Variable neighborhood tabu search; COPERT model equations; Pollutant emissions; GREENHOUSE-GAS EMISSIONS; OPTIMIZATION APPROACH; FLEET SIZE; ROUTES; REDUCTION; TIMES;
D O I
10.1007/s11750-019-00505-5
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper focuses on designing waste collection routes with a single landfill using eco-efficiency as a performance indicator. In this problem, there are a limited number of heterogeneous vehicles based at a single depot. Empty vehicles leave the depot, collect waste from a set of locations and drop off the collected waste at a specific landfill. Then, vehicles leave the landfill and may collect more waste from other locations or return empty to the depot. Traditional performance indicators in vehicle routing problems are mainly focused on economic objectives, not explicitly considering environmental issues. In this paper, a mathematical model is presented with an eco-efficient objective function that takes into account external costs (climate change and air pollution). The COPERT model is used for estimating fuel consumption, carbon dioxide and pollutant emissions. The problem is first heuristically solved using a semi-parallel construction algorithm. Then, solutions are improved by a variable neighborhood tabu search algorithm developed for this problem. The algorithm is validated for a real problem in the municipality of Alcala de Guadaira, within the metropolitan area of Seville (Spain). Results obtained on a set of case studies improve the solution that is currently implemented in the municipality, in terms of total distance traveled, carbon dioxide emissions and pollutant emissions.
引用
收藏
页码:253 / 287
页数:35
相关论文
共 72 条
[41]   Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem [J].
Kuo, Yiyo .
COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (01) :157-165
[42]   A practical solution approach for the green vehicle routing problem [J].
Leggieri, Valeria ;
Haouari, Mohamed .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 104 :97-112
[43]   A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem [J].
Li, Feiyue ;
Golden, Bruce ;
Wasil, Edward .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (09) :2734-2742
[44]   Survey of Green Vehicle Routing Problem: Past and future trends [J].
Lin, Canhong ;
Choy, K. L. ;
Ho, G. T. S. ;
Chung, S. H. ;
Lam, H. Y. .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (04) :1118-1138
[45]   The fleet size and mix vehicle routing problem with time windows [J].
Liu, FH ;
Shen, SY .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (07) :721-732
[46]   Vehicle routing and scheduling with time-varying data: A case study [J].
Maden, W. ;
Eglese, R. ;
Black, D. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (03) :515-522
[47]   Variable neighborhood search [J].
Mladenovic, N ;
Hansen, P .
COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (11) :1097-1100
[48]   An optimization approach for designing routes in metrological control services: a case study [J].
Molina, Jose Carlos ;
Eguia, Ignacio ;
Racero, Jesus .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2018, 30 (04) :924-952
[49]   A multi-space sampling heuristic for the green vehicle routing problem [J].
Montoya, Alejandro ;
Gueret, Christelle ;
Mendoza, Jorge E. ;
Villegas, Juan G. .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2016, 70 :113-128
[50]  
Ntziachristos L., 2009, EMEP EEA EMISSION IN