Ant Based Heuristics for the Capacitated Fixed Charge Location Problem

  • Harry Venables
  • Alfredo Moscardini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)


This paper presents two different \(\mathcal{MAX-MIN}\) Ant System (\(\mathcal{MM}\)AS) based algorithms for the Capacitated Fixed Charge Location Problem (CFCLP) which is a discrete facility location problem that consists of selecting a subset of facilities that must completely supply a set of customers at a minimum cost. The first algorithm is concerned with extending and improving existing work primarily by introducing a previously unconsidered local search scheme based on pheromone intensity. Whilst, the second method makes a transformation of the derived \(\mathcal{MM}\)AS algorithm into the hyper-cube famework in an attempt to improve efficiency and robustness. Computational results for a series of standard benchmark problems are presented and indicate that the proposed methods are capable of deriving optimal solutions for the CFCLP.


Location Problem Facility Location Problem Local Search Phase Capacitate Facility Location Problem Unit Transportation Cost 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Daskin, M.: Network and Discrete Location: Models, Algorithms and Applications. John Wiley and Sons, Inc., New York (1995)zbMATHGoogle Scholar
  2. 2.
    Drezner, Z. (ed.): Facility Location. A Survey of Applications and Methods. Springer, New York (1995)Google Scholar
  3. 3.
    Klose, A., Drexl, A.: Facility location models for distribution system design. European Jounal of Operational Research (2004)Google Scholar
  4. 4.
    Agar, M., Sahli, S.: Lagrangean heuristics applied to variety of large capacitated plant location problems. J. Opl. Res. Soc. 49(10), 1072–1084 (1998)zbMATHCrossRefGoogle Scholar
  5. 5.
    Beasley, J.: Lagrangean heuristcs for location problems. Eur. J. Opl. Res. 65, 383–399 (1993)zbMATHCrossRefGoogle Scholar
  6. 6.
    Bornstein, C., Campêlo, M.: An add/drop procedure for the capacitated plant location problem. Pesquisa Operacional 24(1), 151–162 (2004)Google Scholar
  7. 7.
    Bornstein, C., Azlan, H.: The use of reduction tests and simulated annealing for the capacitated plant location problem. Loc. Sci. 6, 67–81 (1998)CrossRefGoogle Scholar
  8. 8.
    Jaramillo, J., Bhadur, J., Batta, R.: On the use of genetic algorithms to solve location problems. Computers and Operations Research 29, 761–779 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Filho, V., Galváo, R.: A tabu search heuristic for the concentrator location problem. Location Science 6, 189–209 (1998)CrossRefGoogle Scholar
  10. 10.
    Sörensen, K.: Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation. J. Opl. Res. Soc. 59(5), 624–636 (2008)zbMATHCrossRefGoogle Scholar
  11. 11.
    Ahuja, R., Orlin, J., Pallottino, S., Scaparra, M., Scutellà, M.: A multi-exchange heuristic for the single-source capacitated facility location problem. Mgmt. Sci. 50(6), 749–760 (2004)CrossRefGoogle Scholar
  12. 12.
    Bischoff, M., Dächert, K.: Allocation search methods for a generalized class of location-allocation problems. European Jounal of Operational Research (2007)Google Scholar
  13. 13.
    Olivetti, F., Zuben, F.V., de Castro, L.N.: MAX-MIN ant system and capacitated p-medians: Extensions and improved solutions. Informatica 29, 163–171 (2005)zbMATHGoogle Scholar
  14. 14.
    Levanova, T., Loresh, M.: Ant colony optimization algorithm for the capacitated plant location problem. In: 12th IFAC Symposium on Information Control Problems in Manufacturing - INCOM 2006, vol. 3, pp. 423–428 (2006)Google Scholar
  15. 15.
    Venables, H., Moscardini, A.: An adaptive search heuristic for the capacitated fixed charge facility location problem. In: Dorigo, M., Gambardella, L., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 348–355. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Chen, C., Ting, C.: Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transportation Research Part E (2007)Google Scholar
  17. 17.
    Stützle, T., Hoos, H.: The MAX-MIN ant system. Fut. Gen. Com. Sys. 16(8), 889–914 (2000)CrossRefGoogle Scholar
  18. 18.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)zbMATHGoogle Scholar
  19. 19.
    Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics - Part B 34(2), 1161–1172 (2004)CrossRefGoogle Scholar
  20. 20.
    Beasley, J.: Or-library: Distributing test problems by electronic mail. In: Operations Research Proceedings, vol. 41, pp. 1069–1079. Springer, Heidelberg (1990)Google Scholar
  21. 21.
    Lougee-Heimer, R.: The common optimization interface for operations research. IBM Journal of Research and Development 47(1), 57–66 (2003)CrossRefGoogle Scholar
  22. 22.
    Caserta, M., Quiñonez Rico, E.: k A cross entropy-based metaheuristic algorithm for large scale facility location problems. In: MIC - VII Metaheuristic International Conference (June 2007)Google Scholar
  23. 23.
    Dorigo, M., Zlochin, M., Meuleau, N., Birattari, M.: Updating ACO pheromones using stochastic gradient ascent and cross-entropy methods. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 21–30. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Harry Venables
    • 1
  • Alfredo Moscardini
    • 2
  1. 1.Sunderland Business SchoolUniversity of SunderlandUK
  2. 2.School of Computing & TechnologyUniversity of SunderlandUK

Personalised recommendations