Optimizing the VRP by minimizing fuel consumption

被引:44
作者
Kuo, Yiyo [1 ]
Wang, Chi-Chang [2 ]
机构
[1] Hsing Kuo Univ Management, Dept Technol Management, Tainan, Taiwan
[2] Feng Chia Univ, Dept Mech & Comp Aided Engn, Taichung, Taiwan
关键词
Fuel consumption; Transportation;
D O I
10.1108/14777831111136054
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Purpose - In recent years, people have started to realize the importance of environmental protection, and in particular the problem of global warming. Consequently, many governments have started to view decreasing carbon emissions as a priority. Green transportation is one of the policies that is relevant to these efforts. This research aims to optimize the routing plan with minimizing fuel consumption. Design/methodology/approach - In this research, a model is proposed for calculating the total fuel consumption when given a routing plan. Three factors which greatly affect fuel consumption of transportation - transportation distance, transportation speed and loading weight - are taken into consideration. Then a simple Tabu Search is used to optimize the routing plan and an experimental evaluation of the proposed method is performed. Findings - It is shown that the proposed method provides substantial improvements over a method based on minimizing transportation distances. Originality/value - The experimental results show that the routing plans found by the proposed method require less fuel consumption than that found by optimizing methods in which the distance travelled was minimized. That means that, if the distribution center can transport goods using vehicles with better fuel consumption, and the drivers can drive in the such a way as to reduce the discharge of carbon, then the proposed method can be a strategy for the continuous improvement of fuel consumption.
引用
收藏
页码:440 / 450
页数:11
相关论文
共 19 条
[1]   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
[2]   Scatter search for the fleet size and mix vehicle routing problem with time windows [J].
Belfiore, Patricia Prado ;
Lopes Favero, Luiz Paulo .
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2007, 15 (04) :351-368
[3]   A tabu search approach for the flow shop scheduling problem [J].
Ben-Daya, M ;
Al-Fawzan, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (01) :88-95
[4]   An algorithm for the capacitated vehicle routing problem with route balancing [J].
Borgulya, Istvan .
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2008, 16 (04) :331-343
[5]   The real-time time-dependent vehicle routing problem [J].
Chen, Huey-Kuo ;
Hsueh, Che-Fu ;
Chang, Mei-Shiang .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2006, 42 (05) :383-408
[6]  
Fagerholt K., 1999, International Transactions in Operational Research, V6, P453, DOI 10.1111/j.1475-3995.1999.tb00167.x
[7]   GENETIC ALGORITHMS AND TABU SEARCH - HYBRIDS FOR OPTIMIZATION [J].
GLOVER, F ;
KELLY, JP ;
LAGUNA, M .
COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (01) :111-134
[8]  
Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]
[9]   Vehicle dispatching with time-dependent travel times [J].
Ichoua, S ;
Gendreau, M ;
Potvin, JY .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (02) :379-396
[10]   Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds [J].
Kuo, Yiyo ;
Wang, Chi-Chang ;
Chuang, Pei-Ying .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 57 (04) :1385-1392