Hybrid model for the vehicle routing problem with stochastic demand
by Keisuke Murakami, Hiroshi Morita
International Journal of Applied Management Science (IJAMS), Vol. 2, No. 3, 2010

Abstract: The vehicle routing problem with stochastic demand (VRPSD) is one of the most important problems in distribution and transportation. The classical models for the vehicle routing problem with stochastic demand are the chance-constrained model and the penalty model. This paper proposes the hybrid model which combines the chance-constrained model and the penalty model. The travel cost of the hybrid model is less than that of the chance-constrained model and the worst case is guaranteed though the hybrid model may have more travel cost than the penalty model. We formulate the VRPSD as a set covering problem and this problem is solved using a column generation approach. We propose the solution methods for the hybrid model. The solution method is based on saving algorithm. In numerical results, we compare the results of the chance-constrained model, the penalty model and the hybrid model.

Online publication date: Sun, 06-Jun-2010

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 Applied Management Science (IJAMS):
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