Login | Register

Heuristics for Truck Scheduling at Cross Docking Terminals


Heuristics for Truck Scheduling at Cross Docking Terminals

Yan, Wenying (2014) Heuristics for Truck Scheduling at Cross Docking Terminals. Masters thesis, Concordia University.

Text (application/pdf)
Yan_MSc_S2014.pdf - Accepted Version
Available under License Spectrum Terms of Access.


Cross-docking is a logistics management concept that has been gaining global recognition in less-than-truckload logistics industries and retail firms. In cross-docking terminals, shipments are unloaded from inbound trucks at strip doors, consolidated insider cross-docks according to their destinations, and then, loaded into outbound tucks at stack doors. The goal of cross-docking is to reduce inventory and order picking which are the two most costly functions of traditional warehousing management. The sequence in which the inbound and outbound trucks have to be processed at the cross-dock is crucial for improving the efficiency of cross-docking systems. In this thesis we introduce an integer programming formulation and apply four heuristic algorithms: a local search, a simulated annealing, a large neighborhood search and a beam search, to schedule the trucks in a cross-docking terminal so as to minimize the total operational time.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Mechanical and Industrial Engineering
Item Type:Thesis (Masters)
Authors:Yan, Wenying
Institution:Concordia University
Degree Name:M.A. Sc.
Program:Industrial Engineering
Date:7 April 2014
Thesis Supervisor(s):Contreras, Ivan
ID Code:978412
Deposited By: WENYING YAN
Deposited On:16 Jun 2014 20:11
Last Modified:18 Jan 2018 17:46
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top