A fast dynamic programming algorithm to a varied capacity problem in vehicle routing
by Pengle Zhang; Yajie Dou
International Journal of Applied Decision Sciences (IJADS), Vol. 11, No. 2, 2018

Abstract: As a typical combinational optimisation problem, the researches on vehicle routing problem (VRP) mostly focus on the case when vehicle loading capability is certain. In fact, the vehicle loading capability often changes with multi-type vehicles, varying goods size and customer's requirement alter. Thus, a varied capacity vehicle routing problem (VCVRP) is introduced and a fast dynamic programming algorithm is presented based on the K-step best fit deceasing and minimum spanning tree methods, the algorithms can serve as an approximate decoupling between the goods packing problem and router selection problem in VCVRP. Besides, the theoretical analysis on the upper bound of vehicle trip and local minimisation based on short-path priority principle are carried out theoretically. Finally, an example about varied capacity vehicle logistics transportation task is given with quality and performance analysis on different parameters and scales, to illustrate the feasibilities and advantages of the proposed algorithm.

Online publication date: Tue, 03-Apr-2018

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 Decision Sciences (IJADS):
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