Truck dock assignment problem with operational time constraint within crossdocks

Authors:
Andrew Lim;Hong Ma;Zhaowei Miao
Affiliations:
Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Kowloon, Hong Kong;Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Kowloon, Hong Kong;Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Kowloon, Hong Kong
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 6
Cited 2

A survey of dynamic network flows

Annals of Operations Research
An optimal solution to a dock door assignment problem

Proceedings of the 14th annual conference on Computers and industrial engineering
The Quickest Transshipment Problem

Mathematics of Operations Research
Reducing Labor Costs in an LTL Crossdocking Terminal

Operations Research
Airport Gate Scheduling with Time Windows

Artificial Intelligence Review
The over-constrained airport gate assignment problem

Computers and Operations Research

A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock

Computers and Operations Research
Vehicle routing scheduling using an enhanced hybrid optimization approach

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a truck dock assignment problem with operational time constraint in crossdocks where the number of trucks exceeds the number of docks available. The objective is to find an optimal assignment of trucks that minimizes the operational cost of the cargo shipments and the total number of unfulfilled shipments. We combine the above two objectives into one term: the total cost, a sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is then formulated as an Integer Programming (IP) model. A genetic algorithm (GA), in which the operators relate to the IP model constraints, is then proposed. Computational experiments are conducted, showing that the proposed GA dominates the CPLEX Solver in nearly all test cases adapted from industrial applications.