Skip to main content
SpringerLink
Log in

Investigating Metaheuristics Applications for Capacitated Location Allocation Problem on Logistics Networks

  • Chapter
  • First Online:
Chaos Modeling and Control Systems Design

Part of the book series: Studies in Computational Intelligence ((SCI,volume 581))

Abstract

Logistics is vital to sustaining many industrial, commercial, and administrative activities. It is often composed of the logistics service providers and the customers being serviced. The goal of service providers is to maximize revenues by servicing customers efficiently within their preferred timelines. To achieve this goal, they are often involved in activities of location-allocation planning, that is, which logistics facilities be opened, where they should be opened, and how customer allocations should be performed to ensure timely service to customers at least delivery costs to logistics operators. Location-allocation problem is NP-hard. In literature, metaheuristics have been shown to perform better than exact programming approaches to tackle larger NP-hard problems. We present four metaheuristics based solution approaches namely Genetic algorithms (GA), Simulated annealing (SA), Tabu search (TS), and Ant colony optimization (ACO) to address the capacitated location allocation problem on logistics networks. The problem is studied under two cases. In the first case, opening costs of the facilities and only one criterion (distance) is used. In the second case, opening costs of the facilities and multiple criteria (distance, travel cost, travel time) are used. The proposed approaches are tested under various problem instances to verify and validate the model results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdinnour-Helm, S.: A hybrid heuristic for the uncapacitated hub location problem. Eur. J. Oper. Res. 106(2–3), 489–499 (1998)

    Article  MATH  Google Scholar 

  2. Alaya, I., Solnon, C., Ghedira, K.: Ant colony optimization for multi-objective optimization problems. Proc. 19th IEEE Int. Conf. Tools Artif. Intell. 01, 450–457 (2007)

    Google Scholar 

  3. Al-khedhairi, A.: Simulated annealing metaheuristic for solving P-median problem. Int. J. Contemp. Math. Sci. 3(28), 1357–1365 (2008)

    MATH  MathSciNet  Google Scholar 

  4. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106–113 (1998)

    Google Scholar 

  5. Azarmand, Z., Neishabouri, E.: Location allocation problem, facility location. Contrib. Manage. Sci. 93–109 (2009)

    Google Scholar 

  6. Cooper, L.: Location-allocation problems. Oper. Res., 11(3), 331–34 (1963)

    Google Scholar 

  7. Cooper, L.: Heuristic methods for location-allocation problems. SIAM Rev. 6(1), 37–53 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cortinhal, M.J., Eugenia, M.: Genetic algorithms for the single source capacitated location problem. Metaheuristics: Comput. Decis. Making, pp. 187–216. Kluwer Academic Publishers, Berlin (2003)

    Google Scholar 

  9. Dorigo, M.: Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy (1992)

    Google Scholar 

  10. Dorigo, M., Stützle, T.: Ant colony optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  11. Drezner, Z.: The planar two-center and two-median problems. Transp. Sci. 18, 351–361 (1984)

    Article  MathSciNet  Google Scholar 

  12. Drezner, Z., Hamacher, H. (eds.) Facility location: applications and theory. Springer, Berlin (2002). ISBN 3-540-42172-6

    Google Scholar 

  13. Glover, F.: Tabu search, part I. ORSA J. Comput. 1(3), 190–206 (1989)

    Google Scholar 

  14. Glover, F, Kochenberger, G.A.: Handbook of metaheuristics, international series in operations research and management science, 57. pp. 321–353. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  15. Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Kluwer Academic Publishers, Boston (1989)

    MATH  Google Scholar 

  16. Gong, D., Gen, M., Yamazaki, G., Xu, W.: Hybrid evolutionary method for capacitated location-allocation problem. Comput. Ind. Eng. 33(3–4), 577–580 (1997)

    Article  Google Scholar 

  17. Ho, W., Lee, C.M.L., Ho, G.T.S.: Optimization of the facility location-allocation problem in a customer-driven supply chain. Oper. Manage. Res. 1, 69–79 (2008)

    Article  Google Scholar 

  18. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Michigan (1975)

    Google Scholar 

  19. Hua, X., Zheng, J., Hu, W.: Ant colony optimization algorithm for computing resource allocation based on cloud computing environment. J. East Chin. Normal Univ. (2010)

    Google Scholar 

  20. Jaramillo, J.H., Bhadury, J., Batta, R.: On the use of genetic algorithms to solve location problems. Comput. Oper. Res. 29, 761–779 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Konak, A., Coit, D.W., Smith, A.E.: Multi-objective optimization using genetic algorithms. Reliabil. Eng. Syst. Saf. 91(9), 992–1007 (2006)

    Google Scholar 

  22. Kwang, M.S., Weng, H.S.: Multiple ant-colony optimization for network routing. In: Proceedings of the First International Symposium on Cyber Worlds. pp. 277–281. Hosei University, Tokyo (2002)

    Google Scholar 

  23. Lin, J.-H., Vitter, J.S.: Approximation algorithms for geometric median problems. Inf. Process. Lett. 44, 245–249 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  24. Lozano, S., Guerrero, F., Onieva, L., Larraneta, J.: Kononen, maps for solving a class of location-allocation problems. Eur. J. Oper. Res. 108, 106–117 (1998)

    Article  MATH  Google Scholar 

  25. Mark, B., John, N., Fred, L.B.: Creating land allocation zones for forest management: a simulated annealing approach. Can. J. For. Res. 34, 1669–1682 (2004)

    Article  Google Scholar 

  26. Marler, T., Arora, J.S.: Multi-objective optimization: concepts and methods for engineering. VDM Verlag, Saarbrucken (2009)

    Google Scholar 

  27. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)

    Article  Google Scholar 

  28. Murray, A.T., Church, R.L.: Applying simulated annealing to location-planning models. J. Heuristics 2, 31–53 (1996)

    Article  Google Scholar 

  29. Ninlawan C.: Location decision in distribution centers. Department of Industrial Engineering, 2548, 237 (2008)

    Google Scholar 

  30. Ostresh, L.M.: SPA: A shortest path algorithm. In: Rushton, G. (ed.) Computer Programs for Location-allocation Problems. Department of Geography, The University of Iowa, Iowa City (1973)

    Google Scholar 

  31. Qin, G.: Logistics distribution center allocation based on ant colony optimization. Syst. Eng. Theor. Pract. 4, 120–124 (2006)

    Google Scholar 

  32. Satani, N., Uchida, A., Deguchi, A., Ohgai, A., Sato, S., Hagishima, S.: Commercial facility location model using multiple regression analysis. Comput. Environ. Urban Syst. 22(3), 219–240 (1998)

    Article  Google Scholar 

  33. Sawaragi, Y., Nakayama, H., Tanino, T.: Theory of Multiobjective Optimization. Academic Press Inc, Florida (1985). ISBN 0126203709, (176, Mathematics in Science and Engineering, Orlando)

    Google Scholar 

  34. Scaparra, M.P., Scutell`a, M.G.: Facilities, locations, customers: Building blocks of location models: A survey, Technical report TR-01–18, Computer Science Department, University of Pisa, Italy (2001)

    Google Scholar 

  35. Scutella, M.G.: The maximum cut congestion problem. In: Gouveia e Mourao (eds.) Proceedings of INOC 2005, Book 3, pp. 670–673. Lisbon (2005)

    Google Scholar 

  36. Silva, C.A., Sousa, J.M.C., Runkler, T.A.: Rescheduling and optimization of logistic processes using GA and ACO. Eng. Appl. Artif. Intell. 21(3), 343–352 (2008)

    Article  Google Scholar 

  37. Silva, M.R., Cunha, C.B.: New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 36(12), 3152–3165 (2009)

    Article  MATH  Google Scholar 

  38. Talbi, E-G.: Metaheuristics: from Design to Implementation. Wiley, New York, 624 p. (2009) ISBN: 978-0-470-27858-1

    Google Scholar 

  39. Villegas, J.G, Palacios, F., Medaglia, A.L.: Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example. Ann. Oper. Res., 109–141. doi:10.1007/s10479-006-0061-4,2006

  40. Vos, B., Akkermans, H.: Capturing the dynamics of facility allocation. Int. J. Oper. Prod. Manage. 16(11), 57–70 (1996)

    Article  Google Scholar 

  41. Zhou, G., Min, H., Gen, M.: The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach. Comput. Ind. Eng. Arch. 43(1–2), 251–261 (2002)

    Article  Google Scholar 

  42. Zhou, G., Min, H., Gen, M.: A genetic algorithm approach to the bi-criteria allocation of customers to warehouses. Int. J. Prod. Econ. 86, 35–45 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIISE, Concordia University, Montreal, Canada

    Yonglin Ren & Anjali Awasthi

Authors
  1. Yonglin Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anjali Awasthi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anjali Awasthi .

Editor information

Editors and Affiliations

  1. Faculty of Computers and Information, Benha University, Benha, Egypt

    Ahmad Taher Azar

  2. Research and Development Centre, Vel Tech University, Chennai, India

    Sundarapandian Vaidyanathan

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ren, Y., Awasthi, A. (2015). Investigating Metaheuristics Applications for Capacitated Location Allocation Problem on Logistics Networks. In: Azar, A., Vaidyanathan, S. (eds) Chaos Modeling and Control Systems Design. Studies in Computational Intelligence, vol 581. Springer, Cham. https://doi.org/10.1007/978-3-319-13132-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13132-0_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13131-3

  • Online ISBN: 978-3-319-13132-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation