{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T03:39:19Z","timestamp":1776915559700,"version":"3.51.2"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,21]],"date-time":"2008-03-21T00:00:00Z","timestamp":1206057600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10589-008-9176-7","type":"journal-article","created":{"date-parts":[[2008,3,20]],"date-time":"2008-03-20T16:40:07Z","timestamp":1206031207000},"page":"639-661","source":"Crossref","is-referenced-by-count":34,"title":["Continuous ant colony system and tabu search algorithms hybridized for global minimization of\u00a0continuous multi-minima functions"],"prefix":"10.1007","volume":"45","author":[{"given":"Akbar","family":"Karimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadi","family":"Nobahari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Siarry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,21]]},"reference":[{"key":"9176_CR1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"3","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search: Part\u00a0I. ORSA J. Comput. 3, 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"9176_CR2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"1","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search: Part\u00a0II. ORSA J. Comput. 1, 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"9176_CR3","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1002\/nme.1620350508","volume":"35","author":"N. Hu","year":"1992","unstructured":"Hu, N.: Tabu search method with random moves for globally optimal design. Int. J. Numer. Methods Eng. 35, 1055\u20131070 (1992)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9176_CR4","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1126\/science.267.5198.664","volume":"667","author":"D. Cvijovic","year":"1995","unstructured":"Cvijovic, D., Klinowski, J.: Taboo search: an approach to the multiple minima problem. Science 667, 664\u2013666 (1995)","journal-title":"Science"},{"key":"9176_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02125453","volume":"63","author":"R. Battiti","year":"1996","unstructured":"Battiti, R., Tecchiolli, G.: The continuous reactive tabu search: blending combinatorial optimization and stochastic search for global optimization. Ann. Oper. Res. 63, 53\u2013188 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9176_CR6","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1002\/(SICI)1097-0207(19970715)40:13<2449::AID-NME172>3.0.CO;2-O","volume":"40","author":"P. Siarry","year":"1997","unstructured":"Siarry, P., Berthiau, G.: Fitting of tabu search to optimize functions of continuous variables. Int. J. Numer. Methods Eng. 40, 2449\u20132457 (1997)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9176_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4615-5775-3_4","volume-title":"Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization","author":"R. Chelouah","year":"1999","unstructured":"Chelouah, R., Siarry, P.: Enhanced continuous tabu search: an algorithm for the global optimization of multiminima functions. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization, vol.\u00a04, pp. 49\u201361. Kluwer Academic, Dordrecht (1999)"},{"key":"9176_CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0377-2217(99)00255-6","volume":"123","author":"R. Chelouah","year":"2000","unstructured":"Chelouah, R., Siarry, P.: Tabu search applied to global optimization. Eur. J. Oper. Res. 123, 256\u2013270 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9176_CR9","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Univ. of Milan, Milan (1992)"},{"key":"9176_CR10","first-page":"134","volume-title":"Proceedings of the First European Conference on Artificial Life","author":"A. Colorni","year":"1992","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceedings of the First European Conference on Artificial Life, pp. 134\u2013142. Elsevier, Amsterdam (1992)"},{"key":"9176_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"1","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 1, 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"key":"9176_CR12","doi-asserted-by":"crossref","unstructured":"Stutzle, T., Hoos, H.: The MAX\u2013MIN ant system and local search for the traveling salesman problem. In: Proceedings of IEEE International Conference on Evolutionary Computation and Evolutionary Programming, pp. 309\u2013314 (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"key":"9176_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9176_CR14","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Dorigo, M.: Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Proceedings of the Twelfth International Conference on Machine Learning, Palo Alto, pp. 252\u2013260 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"9176_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D., Hertz, A.: Ants can colour graphs. J. Oper. Res. Soc. 48, 295\u2013305 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"9176_CR16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"3","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 3, 137\u2013172 (1999)","journal-title":"Artif. Life"},{"key":"9176_CR17","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/S0167-739X(00)00042-X","volume":"16","author":"M. Dorigo","year":"2000","unstructured":"Dorigo, M., Bonabeau, E., Theraulaz, G.: Ant algorithms and stigmergy. Future Gener. Comput. Syst. 16, 851\u2013871 (2000)","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"9176_CR18","first-page":"413","volume":"26","author":"M. Wodrich","year":"1997","unstructured":"Wodrich, M., Bilchev, G.: Cooperative distributed search: the ants\u2019 way. Control Cybern. 26(3), 413\u2013445 (1997)","journal-title":"Control Cybern."},{"key":"9176_CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","volume":"993","author":"G. Bilchev","year":"1995","unstructured":"Bilchev, G., Parmee, I.C.: The ant colony metaphor for searching continuous design spaces. Lect. Notes Comput. Sci. 993, 25\u201339 (1995)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9176_CR20","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N. Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9, N., Venturini, G., Slimane, M.: On how Pachycondyla apicalis ants suggest a new search algorithm. Future Gener. Comput. Syst. 16, 937\u2013946 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"9176_CR21","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.future.2003.07.015","volume":"20","author":"J. Dr\u00e9o","year":"2004","unstructured":"Dr\u00e9o, J., Siarry, P.: Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener. Comput. Syst. 20, 841\u2013856 (2004)","journal-title":"Future Gener. Comput. Syst."},{"key":"9176_CR22","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-45724-0_18","volume":"2463","author":"J. Dr\u00e9o","year":"2002","unstructured":"Dr\u00e9o, J., Siarry, P.: A new ant colony algorithm using the heterarchical concept aimed at optimization of multi-minima continuous functions. Lect. Notes Comput. Sci. 2463, 216\u2013221 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9176_CR23","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-45724-0_29","volume":"2463","author":"C. Ling","year":"2002","unstructured":"Ling, C., Jie, S., Ling, O., Hongjian, C.: A method for solving optimization problems in continuous space using ant colony algorithm. Lect. Notes Comput. Sci. 2463, 288\u2013289 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9176_CR24","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1631\/BF02841077","volume":"1","author":"L.Y. Jun","year":"2003","unstructured":"Jun, L.Y., Jun, W.T.: An adaptive ant colony system algorithm for continuous-space optimization problems. J. Zhejiang Univ. Sci. 1, 40\u201346 (2003)","journal-title":"J. Zhejiang Univ. Sci."},{"key":"9176_CR25","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-28646-2_27","volume":"3172","author":"S.H. Pourtakdoust","year":"2004","unstructured":"Pourtakdoust, S.H., Nobahari, H.: An extension of ant colony system to continuous optimization problems. Lect. Notes Comput. Sci. 3172, 294\u2013301 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9176_CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-28646-2_3","volume":"3172","author":"K. Socha","year":"2004","unstructured":"Socha, K.: ACO for continuous and mixed-variable optimization. Lect. Notes Comput. Sci. 3172, 25\u201336 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9176_CR27","unstructured":"Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. IRIDIA Technical Report, TR\/IRIDIA\/2005-037"},{"key":"9176_CR28","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","volume":"185","author":"K. Socha","year":"2008","unstructured":"Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185, 1155\u20131173 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9176_CR29","unstructured":"Nobahari, H., Pourtakdoust, S.H.: Optimization of fuzzy rule bases using continuous ant colony system. In: Proceedings of the First International Conference on Modeling, Simulation and Applied Optimization, Sharjah, U.A.E., Paper No. 243 (2005)"},{"key":"9176_CR30","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/11571155_10","volume":"3777","author":"H. Nobahari","year":"2005","unstructured":"Nobahari, H., Pourtakdoust, S.H.: Optimal fuzzy CLOS guidance law design using ant colony optimization. Lect. Notes Comput. Sci. 3777, 95\u2013106 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9176_CR31","unstructured":"Nobahari, H., Nabavi, S.Y., Pourtakdoust, S.H.: Aerodynamic shape optimization of unguided projectiles using ant colony optimization. In: Proceedings of ICAS 2006, Hamburg, Germany, 3\u20138 Sept. 2006"},{"key":"9176_CR32","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009626110229","volume":"6","author":"R. Chelouah","year":"2000","unstructured":"Chelouah, R., Siarry, P.: A continuous genetic algorithm designed for the global optimization of multimodal functions. J. Heuristics 6, 191\u2013213 (2000)","journal-title":"J. Heuristics"},{"issue":"2","key":"9176_CR33","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/264029.264043","volume":"23","author":"P. Siarry","year":"1997","unstructured":"Siarry, P., Berthiau, G., Durbin, F., Haussy, J.: Enhanced simulated annealing for globally minimizing functions of many continuous variables. ACM Trans. Math. Softw. 23(2), 209\u2013228 (1997)","journal-title":"ACM Trans. Math. Softw."},{"key":"9176_CR34","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0377-2217(02)00401-0","volume":"148","author":"R. Chelouah","year":"2003","unstructured":"Chelouah, R., Siarry, P.: Genetic and Nelder\u2013Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Eur. J. Oper. Res. 148, 335\u2013348 (2003)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9176-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9176-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9176-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T00:04:24Z","timestamp":1708733064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9176-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,21]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9176"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9176-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,21]]}}}