Multi-depot vehicle routing problem with cooperative transportation in terminal distribution
by Jingjing Hu; Youfang Huang; Zhi-Hua Hu
International Journal of Applied Decision Sciences (IJADS), Vol. 14, No. 5, 2021

Abstract: We design a method of cooperative transportation. In this method, the original scattered transportation resources from express distribution point to terminal distribution center are integrated through cooperative transportation. This is a multi-depot vehicle routing problem. Firstly, we transform it into a vehicle routing problem with single-depot, and the branch and bound (B&B) algorithm is improved to solve it. Next, we design greedy algorithm to solve the vehicle routing problem with multi-depot, and get the approximate optimal solution. The B&B algorithm can get accurate results while the computing time of greedy algorithm is shorter. Directly solving the problem can retain the characteristics of the original problem, and the solution can reflect the actual situation better. The transformation reduces the complexity of the problem, but some feasible solutions may be lost.The experimental results show that the efficiency of transportation resource utilisation is improved after optimisation, which is helpful to make more economic transportation decisions.

Online publication date: Tue, 07-Sep-2021

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