A firefly algorithm for the heterogeneous fixed fleet vehicle routing problem
by Panagiotis-Petros Matthopoulos; Stella Sofianopoulou
International Journal of Industrial and Systems Engineering (IJISE), Vol. 33, No. 2, 2019

Abstract: Vehicle routing is a key success factor in logistics problems. A variation of vehicle routing problem (VRP), the heterogeneous fixed fleet VRP in which the vehicles available for distribution activities are characterised by different capacities and costs, is tackled. A hybrid firefly algorithm for optimising the routing of heterogeneous fixed fleet of vehicles in logistics distribution systems is presented. The principles and key steps of the proposed firefly algorithm are introduced in detail. Experimental results from solving the heterogeneous fixed fleet vehicle routing problem when tested on benchmark datasets are demonstrated. Moreover, the algorithm is compared with other algorithms solving similar problems in order to prove the effectiveness of the proposed hybrid firefly algorithm.

Online publication date: Fri, 27-Sep-2019

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 Industrial and Systems Engineering (IJISE):
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