Reactive Tabu Search for Large Scale Service Parts Logistics Network Design and Inventory Problems

  • Yi Sui
  • Erhan Kutanoglu
  • J. Wesley Barnes


This chapter documents a study of a reactive tabu search (RTS) approach to the integrated service part logistics (SPL) network design and inventory stocking problem. The integrated problem of designing and stocking an SPL network has attracted more attention recently. The two sets of decisions (network design and inventory stocking) usually have been considered separately and sequentially in practice as well as in the research literature, although interdependency between them exists and integration is necessary for overall system performance optimization. However, the integrated mathematical programming model and solution development for this problem are often intractable due to the time-based service constraints which confine the lower bound of the demand percentage satisfied within the specified time windows. We use a RTS method to efficiently find very good solutions to this problem. Tabu search combines a hill climbing strategy with a memory structure which guides the search. The reactive mechanism dynamically adjusts the tabu tenure during the search. An escape mechanism is activated when the search is trapped in a local attractor basin. We also apply heuristic techniques to construct the initial solution and use rule based comparisons to determine the best non-tabu solution in a neighborhood about the current incumbent solution. By applying this metaheuristic method to problem sets of different sizes, we obtain high-quality solutions with remarkably small amounts of computational effort. For the smaller problems, the tabu search solution is identical or very close to the optimal solution provided by classical optimization-based methods. For the larger problems, RTS obtains solutions superior to those obtained by classical approaches.


Tabu Search Service Level Mixed Integer Programming Fill Rate Network Design Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Agrawal V, Seshadri S (2000) Distribution free bounds for service constrained (Q, r) inventory systems. Naval Res Logist 47:635–656CrossRefMathSciNetMATHGoogle Scholar
  2. Barahona F, Jensen D (1998) Plant location with minimum inventory. Math Program 83:101–111MathSciNetMATHGoogle Scholar
  3. Barnes JW, Carlton WB (1995) Solving the vehicle routing problem with time windows using reactive tabu search. INFORMS Conf, New OrleansGoogle Scholar
  4. Battiti R, Tecchiolli G (1994) The Reactive Tabu Search. ORSA J Comput 6:126–140MATHGoogle Scholar
  5. Budenbender K (2000) A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem. Transp Sci 34:364–380CrossRefGoogle Scholar
  6. Carlton WB, Barnes JW (1996) Solving the traveling salesman problem with time windows using tabu search. IEE Transactions 28, 617–629.Google Scholar
  7. Candas MF, Kutanoglu E (2007) Benefits of considering inventory in service parts logistics network design problems with time-based service constraints. IIE Trans 39:159–176CrossRefGoogle Scholar
  8. Chelouah R, Siarry P (2005) A hybrid method combining continuous tabu search and Nelder-Mead simples algorithms for the global optimization of multiminima functions. Eur J Oper Res 161:636–654CrossRefMathSciNetMATHGoogle Scholar
  9. Chen FY, Krass D (2001) Inventory models with minimal service level constraints. Eur J Oper Res 134:120–140CrossRefMathSciNetMATHGoogle Scholar
  10. Ciarleglio MI (2007) Modular abstract self-learning tabu search (MASTS) metaheuristic search theory and practice. PhD Dissertation, the University of Texas at AustinGoogle Scholar
  11. Ciarleglio MI, Barnes JW, Sarkar S (2008) ConsNet—a tabu search approach to the spatially coherent conservation area network design problem. J Heuristics. (to appear)
  12. Cohen MA, Kleindorfer PR, Lee HL (1988) Service constrained (s, S) inventory systems with priority demand classes and lost sales. Manage Sci 34:482–499CrossRefMATHGoogle Scholar
  13. Cohen MA, Kamesam PV, Kleindorfer PR, Lee HL, Tekerian A (1990) Optimizer: IBM’s multi-echelon inventory system for managing service logistics. Interfaces 20:65–82CrossRefGoogle Scholar
  14. Cohen MA, Zheng Y-S, Agrawal V (1997) Service parts logistics: a benchmark analysis. IIE Trans 29:627–639Google Scholar
  15. Cohen MA, Zheng Y-S, Wang Y (1999) Identifying opportunities for improving Teradyne’s service-parts logistics system. Interfaces 29:1–18CrossRefGoogle Scholar
  16. Cohen MA, Cull C, Lee HL, Willen D (2000) Saturn’s supply-chain innovation: high value in after-sales service. MIT Sloan Manag Rev 41:93–101Google Scholar
  17. Crainic TG, Gendreau M (2002) Cooperative parallel tabu search for capacitated network design. J Heuristics 8:601–627CrossRefGoogle Scholar
  18. Crainic TG, Toulouse M, Gendreau M (1995) Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spect 17:113–123MATHGoogle Scholar
  19. Crainic TG, Toulouse M, Gendreau M (1996) Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Ann Oper Res 63:277–299CrossRefMATHGoogle Scholar
  20. Daskin MS, Coullard CR, Shen ZM (2002) An inventory-location model: formulation, solution algorithm and computational results. Ann Oper Res 110:83–106CrossRefMathSciNetMATHGoogle Scholar
  21. Drezner Z (1995) Facility location: A survey of applications and methods. Springer, New YorkGoogle Scholar
  22. Dumitrescu I, Stutzle T (2002) Combinations of local search and exact algorithms. In: Proceedings of applications of evolutionary computing EvoWorkshop. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, pp 211–223Google Scholar
  23. Glover F (1989) Tabu search—part I. ORSA J Comput 1:190–206MathSciNetMATHGoogle Scholar
  24. Glover F (1990) Tabu search—part II. ORSA J Comput 2:4–32MATHGoogle Scholar
  25. Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459CrossRefMATHGoogle Scholar
  26. Jeet V (2006) Logistics network design with inventory stocking, time-based service and part commonality. PhD Dissertation, The University of Texas at AustinGoogle Scholar
  27. Jeet V, Kutanoglu E, Partani A (2009) Logistics network design with inventory stocking for low-demand parts: modeling and optimization. IIE Trans 41(5):389–407CrossRefGoogle Scholar
  28. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9:643–666CrossRefGoogle Scholar
  29. Magnanti TL, Wong RT (1984) Network design and transportation planning: model and algorithms. Transp Sci 18:1–55CrossRefGoogle Scholar
  30. Melkote S, Daskin MS (2001a) An integrated model of facility location and transportation network design. Transp Res A 35:515–538Google Scholar
  31. Melkote S, Daskin MS (2001b) Capacitated facility location/network design problems. Eur J Oper Res 129:481–495CrossRefMathSciNetMATHGoogle Scholar
  32. Muckstadt JA (1973) A model for a multi-item, multi-echelon, multi-indenture inventory system. Manage Sci 20:472–481CrossRefMATHGoogle Scholar
  33. Muckstadt JA (2005) Analysis and algorithms for service parts supply chains. Springer, New YorkMATHGoogle Scholar
  34. Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res B 34:107–121CrossRefGoogle Scholar
  35. Nozick LK (2001) The fixed charge facility location problem with coverage restrictions. Transp Res E 37:281–296CrossRefGoogle Scholar
  36. Nozick LK, Turnquist MA (1998) Integrating inventory impacts into a fixed-charge model for locating distribution centers. Transp Res E 34:173–186CrossRefGoogle Scholar
  37. Poole K (2003) Seizing the potential of the service supply chain. Supply Chain Management Review 7(4):54–61Google Scholar
  38. Rustenburg WD, van Houtum GJ, Zijm WHM (2001) Spare parts management at complex technology-based organizations: an agenda for research. Int J Prod Econ 71:177–193CrossRefGoogle Scholar
  39. Shen ZM, Coullard CR, Daskin MS (2003) A joint location-inventory model. Transp Sci 37:40–55CrossRefGoogle Scholar
  40. Sherbrooke CC (1968) METRIC: a Multi-Echelon Technique for recoverable item control. Oper Res 16:122–141CrossRefGoogle Scholar
  41. Sherbrooke CC (1986) VARI-METRIC: improved approximations for multi-indenture, multi-echelon availability models. Oper Res 34:311–319CrossRefGoogle Scholar
  42. Simchi-Levi D (1991) The capacitated traveling salesmen location problem. Transp Sci 25:9–18CrossRefMathSciNetMATHGoogle Scholar
  43. Sui Y (2008) Solving service part logistics network design and inventory stocking problems with reactive tabu search. Master Report, The University of Texas at AustinGoogle Scholar
  44. Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19:1363–1373CrossRefMATHGoogle Scholar
  45. Xu J, Chiu SY, Glover F (1996) Probabilistic tabu search for telecommunications network design. Combin Optim Theory Practice 1:69–94Google Scholar
  46. Zipkin P (2000) Fundamentals of inventory management. McGraw Hill-Irwin, BostonGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.MicroStrategy, IncMcLeanUSA
  2. 2.The University of Texas at AustinAustinUSA

Personalised recommendations