×

zbMATH — the first resource for mathematics

Truck dock assignment problem with time windows and capacity constraint in transshipment network through crossdocks. (English) Zbl 1172.90405
Gavrilova, Marina (ed.) et al., Computational science and its applications – ICCSA 2006. International conference, Glasgow, UK, May 8–11, 2006. Proceedings, Part III. Berlin: Springer (ISBN 3-540-34075-0/pbk). Lecture Notes in Computer Science 3982, 688-697 (2006).
Summary: 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.
For the entire collection see [Zbl 1107.68010].

MSC:
90B35 Deterministic scheduling theory in operations research
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C59 Approximation methods and heuristics in mathematical programming
Software:
CPLEX
PDF BibTeX XML Cite
Full Text: DOI