Next Article in Journal
Comprehensive Assessment on Sustainable Development of Highway Transportation Capacity Based on Entropy Weight and TOPSIS
Next Article in Special Issue
Sources of China’s Economic Growth: An Empirical Analysis Based on the BML Index with Green Growth Accounting
Previous Article in Journal
Safety or Salamanders? Natural Hazards and Environmental Conservation in Comprehensive Planning
Previous Article in Special Issue
The Role of Intermediation in the Governance of Sustainable Chinese Web Marketing
Article Menu

Export Article

Open AccessArticle
Sustainability 2014, 6(7), 4658-4684; doi:10.3390/su6074658

Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

1
Department of Tourism Information, Aletheia University, New Taipei City 251, Taiwan
2
Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu 300, Taiwan
3
Institute of Service Management, National Penghu University of Science and Technology, Penghu 880, Taiwan
4
School of Business, Soochow University, Suzhou 215006, China
*
Author to whom correspondence should be addressed.
Received: 25 June 2014 / Revised: 13 July 2014 / Accepted: 17 July 2014 / Published: 23 July 2014
(This article belongs to the Special Issue Special issue of Sustainable Asia Conference 2014)
View Full-Text   |   Download PDF [1091 KB, uploaded 24 February 2015]   |  

Abstract

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. View Full-Text
Keywords: carbon footprint; vehicle routing problem; heterogeneous fleet; alternative path; genetic algorithm carbon footprint; vehicle routing problem; heterogeneous fleet; alternative path; genetic algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Liu, W.-Y.; Lin, C.-C.; Chiu, C.-R.; Tsao, Y.-S.; Wang, Q. Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths. Sustainability 2014, 6, 4658-4684.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sustainability EISSN 2071-1050 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top