Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 132, Issue -, Pages 30-47Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2019.10.006
Keywords
Cross-dock door assignment; Multi-floor warehouse; Mixed-integer nonlinear programming; Tabu Search; Genetic random-key; Very-large-scale neighborhood search
Ask authors/readers for more resources
This paper is concerned with the multi-floor, cross-dock door assignment problem (MCDAP) to minimize the total material handling costs. We present a novel mixed-integer nonlinear programming model and a classic linearization form for the MCDAP. We use a combination of multi-start, genetic random-key, and very-large-scale neighborhood search (VLSN) as the diversification strategies for the solution perturbation method embedded within the critical event Tabu search to solve MCDAP. We will test the proposed algorithms on a set of 60 very-large sized instances with 150-300 loading doors, and 100-300 unloading doors that raise size of cost matrix up to 90,000 by 90,000.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available