Abstract
In this work, we develop an efficient meta-heuristic genetic algorithm for a different type of transshipment problem with supplier and customer time windows, where flow through the crossdock (a kind of transshipment center) is constrained by fixed transportation schedules and crossdocks capacities, and which was proved to be NP-complete in the strong sense. And computational experiments are conducted to show the proposed heuristic outperforms CPLEX.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aronson, J.E.: A survey on dynamic network flows. Annals of Operations Research 20, 1–66 (1989)
Axsater, S.: A new decision rule for lateral transshipments in inventory systems. Management Science 49, 1168–1179 (2003)
Axsater, S.: Evaluation of unidirectional lateral transshipments and substitutions in inventory systems. European Journal of Operational Research 149, 438–447 (2003)
Bartholdi III, J.J., Gue, K.R.: Reducing labor costs in an LTL crossdocking terminal. Operations Research 48(6), 823–832 (2000)
Bartholdi III, J.J., Gue, K.R., Kang, K.: Staging freight in a crossdock. In: Proceedings of the International Conference on Industrial Engineering and Production Management, Quebec City, Canada (2001)
Bartholdi III, J.J., Gue, K.R.: The best shape for a crossdock. Transportation Science 38(4), 235–244 (2004)
Donaldson, H., Johnson, E.L., Ratliff, H.D., Zhang, M.: Schedule-driven crossdocking networks, Georgia Institute of Technology, Research Report (1999)
Grahovac, J., Chakravarty, A.: Sharing and lateral transshipment of inventory in a supply chain with expensive low-demand items. Management Science 47(4), 579–594 (2001)
Herer, Y.T., Tzur, M.: The Dynamic Transshipment Problem. Naval Research Logistics Quarterly 48, 386–408 (2001)
Herer, Y.T., Tzur, M., Yücesan, E.: Transshipments: An emerging inventory recourse to achieve supply chain leagility. International J. of Production Economics 80, 201–212 (2002)
Hoppe, B., Tardos, E.: The quickest transshipment problem. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, United States (1995)
Lim, A., Miao, Z., Rodrigues, B., Xu, Z.: Transshipment through crossdocks with inventory and time windows. Naval Research Logistics Quarterly 52(8), 724–733 (2005)
Napolitano, M.: Making the move to crossdocking, Warehousing Education and Research Council (2000)
Ratcliff, D.H., van de Vate, J., Zhang, M.: Network design for load-driven cross-docking systems, Georgia Institute of Technology, Research Report (1999)
Simchi-Levi, D., Kaminsky, P., Simchi-Levi, E.: Designing and Managing the Supply Chain, 2nd edn. McGraw-Hill - Irwin Publishers, Boston (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miao, Z., Fu, K., Fei, Q., Wang, F. (2008). Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds) New Frontiers in Applied Artificial Intelligence. IEA/AIE 2008. Lecture Notes in Computer Science(), vol 5027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69052-8_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-69052-8_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69045-0
Online ISBN: 978-3-540-69052-8
eBook Packages: Computer ScienceComputer Science (R0)