Robust door assignment in less-than-truckload terminals

Authors:
Korhan Acar;Ali Yalcin;Daniel Yankov
Affiliations:
A.T. Kearney, 222 West Adams, Chicago, IL, 60606, United States;University of South Florida, Industrial and Management Systems Engineering Department, 4202 East Fowler Ave. ENB 118, Tampa, FL 33620, United States;Varna International Airport, Fraport Twin Star Airport Management AD, Varna, Bulgaria
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 8
Cited 1

An optimal solution to a dock door assignment problem

Proceedings of the 14th annual conference on Computers and industrial engineering
Using a simulation model to evaluate the configuration of a sortation facility

Proceedings of the 29th conference on Winter simulation
The Effects of Trailer Scheduling on the Layout of Freight Terminals

Transportation Science
Reducing Labor Costs in an LTL Crossdocking Terminal

Operations Research
Genetic-based scheduling to solve the parcel hub scheduling problem

Computers and Industrial Engineering
Scheduling trucks in cross-docking systems: Robust meta-heuristics

Computers and Industrial Engineering
Iterative improvement to solve the parcel hub scheduling problem

Computers and Industrial Engineering
Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage

Expert Systems with Applications: An International Journal

Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The assignment of incoming trailers to strip doors is one of the critical decisions that affect the performance of cross docking operations in less-than-truckload terminals. This paper introduces a mixed integer quadratic model with the objective of generating trailer-to-door assignments that equally distribute idle times at doors to accommodate operational level uncertainty encountered in truck arrival times. A door assignment heuristic is presented. The performance of the heuristic is compared with optimal solutions to small problems. The effectiveness of the proposed heuristic is studied under a variety of circumstances and terminal sizes. The simulation results show that the proposed heuristic is applicable to realistic-size terminals, and it is effective when variability in truck arrival and service times is considered.