Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks
- Cite this paper as:
- Lim A., Ma H., Miao Z. (2006) Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks. In: Gavrilova M. et al. (eds) Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg
In this paper, we consider the over-constrained truck dock assignment problem with time windows and capacity constraint in transshipment network through crossdocks where the number of trucks exceeds the number of docks available, the capacity of the crossdock is limited, and where the objective is to minimize the total shipping distances. The problem is first formulated as an Integer Programming (IP) model, and then we propose a Tabu Search (TS) and a Genetic algorithms (GA) that utilize the IP constraints. Computational results are provided, showing that the heuristics perform better than the CPLEX Solver in both small-scale and large-scale test sets. Therefore, we conclude that the heuristic search approaches are efficient for the truck dock assignment problem.
Areas: Heuristics, industrial applications of AI.
KeywordsHeuristic search crossdocks dock assignment
Unable to display preview. Download preview PDF.