SOLVING A SSCFLP IN A SUPPLY CHAIN WITH ACO

Ketsara Kumweang; Ruengsak Kawtummachai

Authors

Ketsara Kumweang Industrial Engineering Program, Sirindhorn International Institute of Technology, Thammasat University,
Ruengsak Kawtummachai Industrial Engineering Program, Sirindhorn International Institute of Technology, Thammasat University,

Keywords:

Supply chain management, facility location, single-source capacitated facility location problem, colony optimization

Abstract

In this article, we have examined a Single-Source Capacitated Facility Location Problem (SSCFLP), in which each customer in the chain can only be supplied from exactly one facility. Given a set of potential locations and the facility capacities, it must be decided where and how many facilities must be opened and which customer must be assigned to each opened facility. The objective of this study is to find the suitable facilities to be opened and therefore the corresponding costs that consist of the cost of establishing facilities, the transportation cost and the uncovered demand cost which will be optimized. We have constructed an algorithm based on the Ant Colony Optimization (ACO) and tested by a simulation test. The results have then been compared with the general algorithm and the optimal solution to identify the efficiency of the algorithm. The simulation test has shown that the proposed algorithm performed very well.

References

Aguilar, J. (2001). A General Ant Colony Model to solve Combinatorial Optimization Problems. Revista Colombiana De Comutación, 2(1):7-18.

Bonabeau, E., Dorigo, M., and Theraulaz, G. (2000). Inspiration for optimization from social insect behavior. NATURE, 406: 39-42.

Church, R., and ReVelle, C.C. (1974). The maximal covering location problem. Paper of the Regional Science Association, 32:101-118.

Dorigo, M., Bonabeau, E., and Theraulaz, G. (2000). Ant algorithms and stigmergy. Future Generation Computer Systems, 16:851-871.

Dorigo, M., Maniezzo, V., and Colorni, A. (1996). The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):1-13.

Dorigo, M., and Di Caro, G. (1999). The ant colony optimization meta-heuristic. New ideas in Optimization, McGraw-Hill, Berkshine, p. 11-32.

Feo, T.A., and Resende, M.G.C. (1995). Greedy randomized adaptive search heuristic. Journal of Global Optimization, 6:109- 133.

Gutjahr, W.J. (2000). A graph-based ant system and its convergence. Future Generation Computer Systems, 16:873-888.

Hillsman, E.L. (1984). The P-median structure as a unified linear model for locationallocation analysis. Environment and Planning A, 16:305-318.

Louren็o, H.R.D., and Serra, D. (2002). Adaptive search heuristic for the generalized assignment problem. Mathware and Soft Computing, 9(2-3): 209-234.

Maniezzo, V., and Carbonaro, A. (2000). An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems, 16:927-935.

Nozick, L.K., and Turnquist, M.A. (2001). Inventory, transportation, service quality and the location of distribution centers. European Journal of Operation Research, 129:362-371.

Stützle, T., and Hoos, H.H. (1997). MAX-MIN ant system and local search for combinatorial optimization problems. Proceedings of the 2nd International Conference on Metaheuristic-MIC97; Sophia-Antipolis; July 21-24, 1997; France, p. 1-15.

Stützle, T., and Hoos, H.H. (1999). MAX-MIN ant system and local search for combinatorial optimization. Meta-Heuristics: Trends in Local Search paradigms for Optimization. In: S. Voβ, S. Martello, I.H. Osman and C. Roucairol (eds). Kluwer Acadamic Publishers, Dordrecht, p. 313- 329.

Stützle, T., and Hoos, H.H. (2000). MAX-MIN ant system. Future Generation Computer Systems, 16:889-914.