Abstract
A method for solving optimization problem with continuous parameters using improved ant colony algorithm is presented. In the method, groups of candidate values of the components are constructed, and each value in the group has its trail information. In each iteration of the ant colony algorithm, the method first chooses initial values of the components using the trail information. Then, crossover and mutation can determine the values of the components in the solution. Our experimental results of the problem of nonlinear programming show that our method has much higher convergence speed and stability than that of GA, and the drawback of ant colony algorithm of not being suitable for solving continuous optimization problems is overcome.
This research was supported in part by Chinese National Science Foundation, Science Foundation of Jaingsu Educational Commission, China.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of coorperating agents. IEEE Trans. on SMC 26(1), 28–41 (1996)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computing 1(1), 53–56 (1997)
Colorni, A., Dorigo, M., Maniezzo, V.: Ant colony system for job-shop scheduling. Belgian J. of Operations Research Statistics and Computer Science 34(1), 39–53 (1994)
Maniezzo, V.: Exact and approximate nonditerministic tree search procedures for the quadratic assignment problem. INFORMS J. Comput 11, 358–369 (1999)
Maniezzo, V., Carbonaro, A.: An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems 16, 927–935 (2000)
Gambardella, L.M., Dorigo, M.: HAS-SOP: An Hybrid Ant System for the Sequential Ordering Problem. Tech. Rep. No. IDSIA 97-11, IDSIA, Lugano, Switzerland (1997)
Hadeli, V.P., Kollingbaum, M., Van Brussel, H.: Multi-agent coordination and control using stigmergy. Computers in Industry 53(1), 75–96 (2004)
Eggers, J., Feillet, D., Kehl, S., Wagner, M.O., Yannou, B.: Optimization of the keyboard arrangement problem using an Ant Colony algorithm. European Journal of Operational Research 148(3), 672–686 (2003)
Gravel, M., Price, W.L., Gagné, C.: Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic. European Journal of Operational Research 143(1), 218–229 (2002)
Shelokar, P.S., Jayaraman, V.K., Kulkarni, B.D.: An ant colony classifier system: application to some process engineering problems. Computers & Chemical Engineering 28(9), 1577–1584 (2004)
Scheuermann, B., So, K., Guntsch, M., Middendorf, M., Diessel, O., ElGindy, H., Schmeck, H.: FPGA implementation of population-based ant colony optimization. Applied Soft Computing 4(3), 303–322 (2004)
Gambardella, L., Dorigo, M.: Ant-Q: A reinforcement learning approach to the traveling salesman problem. In: Proceedings of the 11th International Conference on Evolutionary Computation, pp. 616–621 (1996)
Dorigo, M., Luca, M.: A study of Ant-Q. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 656–665. Springer, Heidelberg (1996)
Stutzle, T., Hoos, H.H.: Improvements on the Ant System: Introducting the MAX-MIN Ant System. In: Artificial Neural Networks and Genetic Algorithms, pp. 245–249. Springer, New York (1988)
Gambaradella, L.M., Dorigo, M.: HAS-SOP: Hybrid ant system for the sequential ordering problem. Technical Report, IDSIA (1997)
Botee, H.M., Bonabeau, E.: Evolving ant colony optimization. Adv. Complex Systems 1, 149–159 (1998)
Chen, L., Shen, J., Qin, L.: An Adaptive Ant Colony Algorithm Based on Equilibrium of Distribution. Journal of Software 14(6), 1148–1151 (2003)
Chen, L., Qin, L., et al.: Ant colony algorithm with characteristics of sensation and consciousness. Journal of System Simulation 15(10), 1418–1425 (2003)
Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters 82(3), 145–153 (2002)
Randall, M., Lewis, A.: A Parallel Implementation of Ant Colony Optimization. Journal of Parallel and Distributed Computing 62(9), 1421–1432 (2002)
Bilchev, G., Parmee, I.C.: The ant colony metaphor for searching continuous design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 25–39. Springer, Heidelberg (1995)
Shen, J., Chen, L.: A new approach to solving nonlinear programming. Journal of Systems Science and Systems Engineering 11(1), 28–36 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Shen, J., Qin, L., Fan, J. (2004). A Method for Solving Optimization Problem in Continuous Space Using Improved Ant Colony Algorithm. In: Shi, Y., Xu, W., Chen, Z. (eds) Data Mining and Knowledge Management. CASDMKM 2004. Lecture Notes in Computer Science(), vol 3327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30537-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30537-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23987-1
Online ISBN: 978-3-540-30537-8
eBook Packages: Computer ScienceComputer Science (R0)