Abstract
In this paper, cross-docking centers are designed at a strategic level for distribution planning in a supply chain. To make the strategic decision, a zero-one programming (ZOP) model is presented for the location to determine the minimum number of cross-docks among a set of location centers so that each retailer demand should be met. Then, a hybrid simulated annealing (HSA) algorithm embedded with tabu search (TS) is proposed to solve the presented model. A number of test problems in small and large sizes are examined to illustrate the performance of the proposed HSA algorithm in terms of the solution quality and computational time. Moreover, its efficiency is compared with the classical SA and TS algorithms in detail. Finally, computational results demonstrate that the proposed HSA algorithm outperforms the two classical algorithms and converges fast to high-quality solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Makui, A., Haerian, L., Eftekhar, M.: Designing a multi-objective nonlinear cross-docking location allocation model using genetic algorithm. Journal of Industrial Engineering International 2(3), 27–42 (2006)
Ratliff, H.D., Vate, J.V., Zhang, M.: Network design for load-driven cross-docking systems. Technical report, Georgia Institute of Technology (1998), http://www.isye.gatech.edu/research/files/misc9914.pdf
Donaldson, H., Johnson, E.L., Ratliff, H.D., Zhang, M.: Schedule-driven crossdocking networks. Technical report, Georgia Institute of Technology (1999), http://www.isye.gatech.edu/apps/research-papers/papers/misc9904.pdf
Jayaraman, V., Ross, A.: A simulated annealing methodology to distribution network design and management. European Journal of Operational Research 144, 629–645 (2003)
Sung, C.S., Song, S.H.: Integrated service network design for a cross-docking supply chain network. Journal of the Operational Research Society 54(12), 1283–1295 (2003)
Klose, A., Drexl, A.: Facility location models for distribution system design. European Journal of Operational Research 162(1), 4–29 (2005)
Ross, A., Jayaraman, V.: An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design. Computers & Industrial Engineering 55, 64–79 (2008)
Lim, A., Miao, Z., Rodrigues, B., Xu, Z.: Transshipment through crossdocks with inventory and time windows. Naval Research Logistics 52(8), 724–733 (2005)
Ma, H., Miao, Z., Lim, A., Rodrigues, B.: Cross docking distribution networks with setup cost and time window constraint. Omega 39, 64–72 (2011)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machines. Journal of Chemical Physics 21, 1087–1092 (1953)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Glover, F.: Tabu search: a tutorial. Interfaces 20(4), 74–94 (1990)
Ghodratnama, A., Rabbani, M., Tavakkoli-Moghaddam, R., Baboli, A.: Solving a single-machine scheduling problem with maintenance, job deterioration and learning effect by simulated annealing. Journal of Manufacturing Systems 29, 1–9 (2010)
Liao, T.W., Egbelu, P.J., Chang, P.C.: Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations. International Journal of Production Economics 141, 212–229 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mousavi, S.M., Tavakkoli-Moghaddam, R., Siadat, A., Vahdani, B. (2013). A Hybrid Simulated Annealing Algorithm for Location of Cross-Docking Centers in a Supply Chain. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2013. Lecture Notes in Computer Science, vol 7919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38516-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-38516-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38515-5
Online ISBN: 978-3-642-38516-2
eBook Packages: Computer ScienceComputer Science (R0)