Model and algorithms for dynamic and stochastic vehicle routing problem
by Jingling Zhang; Wanliang Wang; Yanwei Zhao
International Journal of Modelling, Identification and Control (IJMIC), Vol. 18, No. 4, 2013

Abstract: This paper researched a dynamic vehicle routing problem of stochastic requests, in which at the scheduling moment t whether customers need service can be identified, but the demand is a random variable and submits to Poisson distribution. Based on model of M.H Lars, considering the multi-depot and open characteristics, two-stage stochastic programming models with resource are established. Then an adaptive immune quantum-inspired evolutionary algorithm (AIQEA) for this dynamic problem was proposed. In the AIQEA, in order to avoid the search process into the local minimum value an immune operator is introduced to optimise sub-routes. Finally, simulation examples are tested, and analyse the optimisation results of different values of the parameters λ, experiment results show that this method can effectively solve the dynamic vehicle routing problem of stochastic requests.

Online publication date: Sat, 16-Aug-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 Modelling, Identification and Control (IJMIC):
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