Scheduling trucks in a multiple-door cross docking system with unequal ready times
by Mohammad Taghi Assadi; Mohsen Bagheri
European J. of Industrial Engineering (EJIE), Vol. 10, No. 1, 2016

Abstract: Cross docking is a new strategy in logistics mainly consisting of unloading products from inbound trucks, resorting and loading directly into outbound trucks with minimum possible transitional storages. In this paper, we study the truck scheduling problem in a cross docking terminal with multiple receiving and shipping dock doors. The objective is to find the best door assignments, the docking sequences of both inbound and outbound trucks and also product assignments to trucks to minimise the weighted number of tardy trucks, when the ready times for inbound trucks, and different distances between the inbound and outbound doors are considered. The problem is formulated as a mixed-integer linear programming (MILP) model and since the optimisation problem is NP-hard, we suggest simulated annealing and genetic algorithms to solve the model. To evaluate the performance of meta-heuristics, we benefit from numerous different problem instances in the literature and compared the results to a pure random search algorithm and also to GAMS software results for the MILP model. [Received 23 July 2014; Revised 12 January 2015; Revised 30 April 2015; Accepted 20 May 2015]

Online publication date: Thu, 03-Mar-2016

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 European J. of Industrial Engineering (EJIE):
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