Survey of Green Vehicle Routing Problem: Past and future trends

被引:597
作者
Lin, Canhong [1 ]
Choy, K. L. [1 ]
Ho, G. T. S. [1 ]
Chung, S. H. [1 ]
Lam, H. Y. [1 ]
机构
[1] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Hong Kong, Hong Kong, Peoples R China
关键词
Vehicle routing; Green vehicle routing; Reverse logistics; Green Logistics; Literature review; VARIABLE NEIGHBORHOOD SEARCH; ANT COLONY OPTIMIZATION; TRAVELING SALESMAN PROBLEM; HYBRID GENETIC ALGORITHM; SOFT TIME WINDOWS; TABU SEARCH; REVERSE LOGISTICS; FLEET SIZE; DISRUPTION MANAGEMENT; SCHEDULING PROBLEMS;
D O I
10.1016/j.eswa.2013.07.107
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Green Logistics has emerged as the new agenda item in supply chain management. The traditional objective of distribution management has been upgraded to minimizing system-wide costs related to economic and environmental issues. Reflecting the environmental sensitivity of vehicle routing problems (VRP), an extensive literature review of Green Vehicle Routing Problems (GVRP) is presented. We provide a classification of GVRP that categorizes GVRP into Green-VRP, Pollution Routing Problem, VRP in Reverse Logistics, and suggest research gaps between its state and richer models describing the complexity in real-world cases. The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with GVRP and offer an insight into the next wave of research into GVRP. It is hoped that OR/MS researchers together with logistics practitioners can be inspired and cooperate to contribute to a sustainable industry. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1118 / 1138
页数:21
相关论文
共 288 条
[11]  
[Anonymous], TRAVELING SALESMAN P
[12]  
[Anonymous], 2008, J BETRIEBSWIRTSCHAFT, DOI DOI 10.1007/S11301-008-0036-4
[13]  
[Anonymous], THESIS MIT CAMBRIDGE
[14]   Emission control with route optimization in solid waste collection process: A case study [J].
Apaydin, Omer ;
Gonullu, M. Talha .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2008, 33 (02) :71-82
[15]   Selective multi-depot vehicle routing problem with pricing [J].
Aras, Necati ;
Aksen, Deniz ;
Tekin, Mehmet Tugrul .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (05) :866-884
[16]   Worst-case analysis for split delivery vehicle routing problems [J].
Archetti, C ;
Savelsbergh, MWP ;
Speranza, MG .
TRANSPORTATION SCIENCE, 2006, 40 (02) :226-234
[17]   Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows [J].
Archetti, C. ;
Bouchard, M. ;
Desaulniers, G. .
TRANSPORTATION SCIENCE, 2011, 45 (03) :285-298
[18]   A branch-and-cut algorithm for a vendor-managed inventory-routing problem [J].
Archetti, Claudia ;
Bertazzi, Luca ;
Laporte, Gilbert ;
Speranza, Maria Grazia .
TRANSPORTATION SCIENCE, 2007, 41 (03) :382-391
[19]   An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :756-763
[20]   THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM [J].
BALAS, E .
NETWORKS, 1989, 19 (06) :621-636