×

Multiple crossdocks with inventory and time windows. (English) Zbl 1089.90007

Summary: Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consideration delivery and pickup time windows, warehouse capacities and inventory-handling costs. Because of the complexity of the problem, local search techniques are developed and used with simulated annealing and tabu search heuristics. Extensive experiments were conducted and results show that the heuristics outperform CPLEX, providing solutions in realistic timescales.

MSC:

90B05 Inventory, storage, reservoirs
90C59 Approximation methods and heuristics in mathematical programming

Software:

CPLEX; Tabu search
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Napolitano M. Making the move to crossdocking—a practical guide. Warehousing Education and Research Council, 2002.; Napolitano M. Making the move to crossdocking—a practical guide. Warehousing Education and Research Council, 2002.
[2] Bartholdi III JJ, Gue KR, Kang K. Throughput models for unit-load crossdocking, http://web.nps.navy.mil/\( \sim;\); Bartholdi III JJ, Gue KR, Kang K. Throughput models for unit-load crossdocking, http://web.nps.navy.mil/\( \sim;\)
[3] Shaffer, B., Implementing the crossdocking operation, IIE Solutions, 30, 5, 20-23 (2000)
[4] Bartholdi III JJ, Gue KR. The best shape for a crossdock. INFORMS national conference, San Antonio, TX, 2000.; Bartholdi III JJ, Gue KR. The best shape for a crossdock. INFORMS national conference, San Antonio, TX, 2000.
[5] Bartholdi, J. J.; Gue, K. R.; Kang, K., Staging freight in a crossdock, (Proceedings of the International Conference on industrial engineering and production management, Quebec City. Proceedings of the International Conference on industrial engineering and production management, Quebec City, Canada (2001))
[6] Gue KR, Kang K. Staging queues in material handling and transportation systems. Proceedings of the 2001 winter simulation conference, 2001.; Gue KR, Kang K. Staging queues in material handling and transportation systems. Proceedings of the 2001 winter simulation conference, 2001.
[7] Bartholdi, J. J.; Gue, K. R., Reducing labor costs in an LTL crossdocking terminal, Operations Research, 48, 6, 823-832 (2002)
[8] Donaldson H, Johnson EL, Ratliff HD, Zhang M, Schedule-driven cross-docking networks, http://www.isye.gatech.edu/research/files/misc9904.pdf; Donaldson H, Johnson EL, Ratliff HD, Zhang M, Schedule-driven cross-docking networks, http://www.isye.gatech.edu/research/files/misc9904.pdf
[9] Ratliff HD, Vate JV, Zhang M. Network design for load-driven cross-docking systems, http://www.isye.gatech.edu/research/files/misc9914.pdf; Ratliff HD, Vate JV, Zhang M. Network design for load-driven cross-docking systems, http://www.isye.gatech.edu/research/files/misc9914.pdf
[10] Simchi-Levi, D.; Kaminsky, P.; Simchi-Levi, E., Designing and managing the supply chain (2003), McGraw-Hill: McGraw-Hill New York
[11] Logistics today. 10 Best supply chains, December 2003, www.logisticstoday.com; Logistics today. 10 Best supply chains, December 2003, www.logisticstoday.com
[12] Logistics today. Execution at the dock, April 2004, www.logisticstoday.com; Logistics today. Execution at the dock, April 2004, www.logisticstoday.com
[13] Garey, M. R.; Johnson, D. S., Computers and intractability—a guide to the theory of NP-completeness (1979), W.H. Freeman and Company: W.H. Freeman and Company New York · Zbl 0411.68039
[14] Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; Stein, C., Introduction to algorithms (2001), MIT Press: MIT Press Cambridge, MA · Zbl 1047.68161
[15] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 4598, 671-680 (1983) · Zbl 1225.90162
[16] Glover, F.; Laguna, M., Tabu search (1997), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht · Zbl 0930.90083
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.