Integrating route optimisation with vehicle and unloading dock scheduling in LCL cargo collection
by Xuefei Liu; Meifeng Luo; Yifei Zhao
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 11, No. 2/3, 2019

Abstract: Less container load (LCL) has become an increasingly important element in containerised cargo export, due to the involvement of numerous small and medium size enterprises. Traditional cargo collection and consolidation processes are extremely complex and inefficient, which provides an excellent opportunity for improvement through integration. In this paper, we design a two-stage model comprising vehicle route optimisation for cargo collection and vehicle and unloading dock scheduling. In the first stage, namely, the route optimisation model, the Clarke-Wright saving algorithm is used, with the objective of minimising the total transport cost for a given shipment size, weight, and capacity constraint of cargo collection vehicles. In the second stage, the scheduling of both collection vehicles and unloading dock are modelled, using two sub-models for given constraints on the time window of the unloading docks and cargo collection routes. An application of this integrated model is illustrated based on the cargo collection problems in the hinterland of Shanghai port.

Online publication date: Wed, 24-Apr-2019

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 Shipping and Transport Logistics (IJSTL):
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