A hybrid metaheuristic algorithm for the green vehicle routing problem with a heterogeneous fleet
by Seval Ene; İlker Küçükoğlu; Aslı Aksoy; Nursel Öztürk
International Journal of Vehicle Design (IJVD), Vol. 71, No. 1/2/3/4, 2016

Abstract: In this study, the green vehicle routing problem (GVRP) with a heterogeneous fleet is presented for both capacity and time-windows constraints to reduce fuel consumption and consequently to minimise CO₂ emissions. A hybrid metaheuristic algorithm (HMA) is developed to solve this problem to analyse the effect of a heterogeneous fleet on reducing the fuel consumption for the specified variants of GVRP, such as GVRP with capacity constraints and GVRP with time-windows constraints. The proposed HMA is validated using well-known instances with different numbers of customers and fleet configurations. The computational results indicated that the HMA is capable of obtaining good results for GVRP variants within a reasonable amount of time by providing remarkable reductions in fuel consumption and greener fleet configurations.

Online publication date: Fri, 02-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Vehicle Design (IJVD):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com