Applying Multiple Ant Colony System to Solve Single Source Capacitated Facility Location Problem

  • Chia-Ho Chen
  • Ching-Jung Ting
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4150)


In the Single Source Capacitated Facility Location Problem (SSCFLP), n customers and m potential facility locations are given. Each customer i has an associated demand d i that must be supplied only by a single facility j. The cost c ij is the unit shipping cost between customer i and facility j. The capacity of each facility s j is known, as well as the fixed charge f j incurred whenever facility j is opened. The objective of the problem is to locate a number of facilities that serve a set of customers at minimum cost.


Facility Location Location Selection Candidate Site Assignment Rule Pheromone Level 
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. 1.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. Bradford Books. MIT Press, Cambridge (2004)CrossRefGoogle Scholar
  2. 2.
    Hindi, K.S., Pienkosz, K.: Efficient Solution of Large Scale, Single-Source, Capacitated Plant Location Problems. Journal of the operational Research Society 50, 268–274 (1999)MATHCrossRefGoogle Scholar
  3. 3.
    Holmberg, K., Ronnqvist, M., Yuan, D.: An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing. European Journal of Operational Research 113, 544–559 (1999)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Chia-Ho Chen
    • 1
  • Ching-Jung Ting
    • 1
  1. 1.Department of Industrial Engineering and ManagementYuan Ze UniversityChung-LiTaiwan, R.O.C.

Personalised recommendations