A particle swarm optimisation for time-dependent vehicle routing problem with an efficient travel time function
by Seyedhamed Mousavipour; Seyed Mohammad Hossein Hojjati
International Journal of Operational Research (IJOR), Vol. 20, No. 1, 2014

Abstract: Transportation plays an essential role in economic, service, and manufacturing systems. This fact has inspired a vast variety of researches to deal with different aspects of this problem. Vehicle routing problem is one of key issues in this field which has received much attention by researchers. Although there is a vast literature related to the VRP, few researches incorporate different traffic. In this paper, a mathematical model has been presented which considers variations in traffic flow based on an efficient travel time function. The proposed travel time function complies with the first-in, first-out (FIFO) assumption, which does not allow for surpassing. Because of the NP-hardness of the model, a particle swarm optimisation (PSO) method has been implemented and is compared to the mathematical model for small- and medium-sized instances. In addition, a set of large-sized instances have been taken into account in order to evaluate the applicability of the model in practical applications. Experimental results show the capability of the proposed PSO to find qualified solutions in reasonable computation time.

Online publication date: Sat, 21-Jun-2014

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 Operational Research (IJOR):
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