Abstract
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.
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
References
Dorigo, M., Stützle, T.: Ant Colony Optimization. Bradford Books. MIT Press, Cambridge (2004)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, CH., Ting, CJ. (2006). Applying Multiple Ant Colony System to Solve Single Source Capacitated Facility Location Problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_55
Download citation
DOI: https://doi.org/10.1007/11839088_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)