Abstract This paper deals with cross-dock door assignment problems in which the assignments of incoming trucks to strip doors, and outgoing trucks to stack doors are determined, with the objective of minimizing the total handling cost. We present two new mixed integer programming formulations which are theoretically and computationally compared with existing ones. One of such requires a column generation algorithm to solve its associated linear relaxation. We present the results of a series of computational experiments to evaluate the performance of the formulations on a set of benchmark instances. We also perform sensitivity analysis with respect to several input parameters of the Cross-dock Door Assignment Problems.
A comparison of formulations and relaxations for cross-dock door assignment problems
W. Nassief,I. Contreras,B. Jaumard
Published 2018 in Computers & Operations Research
ABSTRACT
PUBLICATION RECORD
- Publication year
2018
- Venue
Computers & Operations Research
- Publication date
2018-06-01
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-32 of 32 references · Page 1 of 1
CITED BY
Showing 1-31 of 31 citing papers · Page 1 of 1