標題: Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths
作者: Liu, Wan-Yu
Lin, Chun-Cheng
Chiu, Ching-Ren
Tsao, You-Song
Wang, Qunwei
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: carbon footprint;vehicle routing problem;heterogeneous fleet;alternative path;genetic algorithm
公開日期: 1-Jul-2014
摘要: Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP). This finds a route with the smallestcarbon footprint, instead of the shortestroute distance, which is the conventional approach, to serve a number of customers with a heterogeneous fleet of vehicles in cases wherethere may not be only one path between each pair of customers, and the vehicle speed differs at different times of the day. Inheriting from the NP-hardness of the vehicle routing problem, the MTHVRPP is also NP-hard. This paper further proposes a genetic algorithm (GA) to solve this problem. The solution representedbyour GA determines the customer serving ordering of each vehicle type. Then, the capacity check is used to classify multiple routes of each vehicle type, and the path selection determines the detailed paths of each route. Additionally, this paper improves the energy consumption model used for calculating the carbon footprint amount more precisely. Compared with the results without alternative paths, our experimental results show that the alternative path in this experimenthas a significant impact on the experimental results in terms of carbon footprint.
URI: http://dx.doi.org/10.3390/su6074658
http://hdl.handle.net/11536/24892
ISSN: 2071-1050
DOI: 10.3390/su6074658
期刊: SUSTAINABILITY
Volume: 6
Issue: 7
起始頁: 4658
結束頁: 4684
Appears in Collections:Articles


Files in This Item:

  1. 000340036600038.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.