Advances in Truck Scheduling at a Cross Dock Facility

Authors:
Mihalis M. Golias;Georgios K. D. Saharidis;Stephanie Ivey;Hercules E. Haralambides
Affiliations:
Department of Civil Engineering, University of Memphis, Memphis, TN, USA;Department of Mechanical Engineering, University of Thessaly, Volos, Greece;Department of Civil Engineering, University of Memphis, Memphis, TN, USA;Center for Maritime Economics & Logistics MEL, Faculty of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands
Venue:
International Journal of Information Systems and Supply Chain Management
Year:
2013

Citing 6
Cited 0

Memetic algorithms: a short introduction

New ideas in optimization
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Vehicle routing scheduling for cross-docking in the supply chain

Computers and Industrial Engineering - Special issue: Logistics and supply chain management
Scheduling Problems in Cross Docking

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Truck scheduling at zero-inventory cross docking terminals

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the authors deal with the scheduling of inbound and outbound trucks to the available inbound and outbound doors at a cross dock facility. They assume that all trucks served at the facility need to meet several deadlines for deliveries and pick-ups and thus request a departure time window from the facility, penalizing the facility operator, on a unit of time basis, if that deadline is not met. To solve the resulting problem with reasonable computational effort, a memetic algorithm is developed and a number of computational examples show the efficiency of the proposed solution algorithm and the advantages of scheduling inbound and outbound trucks simultaneously, as opposed to sequentially.