TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM
Adrian Emanoil Şerbencu, Viorel Minzu, Adriana Şerbencu, Daniela Cernega
2011
Abstract
This paper deals with the analysis for two types of elitist variant proposed for the DASA algorithm. It is usual for the genetic algorithms to keep the best solution found in the population used from next generation. Another way to insert elitist behaviour in algorithms that construct solution is to use the most attractive components in order to obtain god quality solution, and may be the optimal ones. Based on particularities of ant colony based metaheuristics these two types of elitist behaviour were successfully applied to DASA algorithm. In this paper the efficiency of the proposed elitist variants of DASA algorithms is analyzed using experimental results. The analysis is applied to six benchmark functions from the class of high-dimensional real-parameter optimization problems.
References
- Bauer, A., Bullnheimer, B., Hartl, R. F., Strauss, C., 1999. An ant colony optimization approach for the single machine total tardiness problem, In: Proceedings of CEC'99, pp. 1445-1450, IEEE Press, Piscataway, NJ.
- Bauer, A., Bullnheimer, B., Hartl, R. F., Strauss, C., 1999. An ant colony optimization approach for the single machine total tardiness problem, In: Proceedings of CEC'99, pp. 1445-1450, IEEE Press, Piscataway, NJ.
- Bilchev, G., Parmee, I.C., 1995. The ant colony metaphor for searching continuous design spaces, In: T.C. Fogarty (Ed.), Evolutionary Computing, Lecture Notes in Computer Science, vol. 993, Sheeld, UK, pp. 25-39.
- Bilchev, G., Parmee, I.C., 1995. The ant colony metaphor for searching continuous design spaces, In: T.C. Fogarty (Ed.), Evolutionary Computing, Lecture Notes in Computer Science, vol. 993, Sheeld, UK, pp. 25-39.
- Dorigo, M., Maniezzo, V., Colorni, A., 1996. Ant system: optimization by a colony of cooperating agents, IEEE Trans. Systems, Man, Cybernet.-Part B 26 (1) 29-41.
- Dorigo, M., Maniezzo, V., Colorni, A., 1996. Ant system: optimization by a colony of cooperating agents, IEEE Trans. Systems, Man, Cybernet.-Part B 26 (1) 29-41.
- Korošec, P., 2006. Stigmergy as an Approach to Metaheuristic Optimization, Ph.D. Thesis, Jozef Stefan International Postgraduate School, Ljubljana,
- Korošec, P., 2006. Stigmergy as an Approach to Metaheuristic Optimization, Ph.D. Thesis, Jozef Stefan International Postgraduate School, Ljubljana,
- Monmarche, N., Venturini, G., Slimane, M., 2000. On how pachycondyla apicalis ants suggest a new search algorithm, Future Generation Computer Systems, Vol. 16 No. 8, pp. 937-46.
- Monmarche, N., Venturini, G., Slimane, M., 2000. On how pachycondyla apicalis ants suggest a new search algorithm, Future Generation Computer Systems, Vol. 16 No. 8, pp. 937-46.
- Socha, K., 2004. ACO for continuous and mixed-variable optimization, in Proceedings of fourth international workshop on ant colony optimization and swarm intelligence (ANTS'2004), Brussels, Belgium.
- Socha, K., 2004. ACO for continuous and mixed-variable optimization, in Proceedings of fourth international workshop on ant colony optimization and swarm intelligence (ANTS'2004), Brussels, Belgium.
- Tang, K., Yao, X., Suganthan, P. N., MacNish, C., Chen, Y. P., Chen, C. M. and Yang, Z., 2007. “Benchmark functions for the CEC'2008 special session and competition on large scale global optimisation”, Technical Report NCL-TR-2007012, University of Science and Technology of China, Hefei.
- Tang, K., Yao, X., Suganthan, P. N., MacNish, C., Chen, Y. P., Chen, C. M. and Yang, Z., 2007. “Benchmark functions for the CEC'2008 special session and competition on large scale global optimisation”, Technical Report NCL-TR-2007012, University of Science and Technology of China, Hefei.
- f5
- f5
Paper Citation
in Harvard Style
Emanoil Şerbencu A., Minzu V., Şerbencu A. and Cernega D. (2011). TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8425-74-4, pages 136-141. DOI: 10.5220/0003539301360141
in Harvard Style
Emanoil Şerbencu A., Minzu V., Şerbencu A. and Cernega D. (2011). TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8425-74-4, pages 136-141. DOI: 10.5220/0003539301360141
in Bibtex Style
@conference{icinco11,
author={Adrian Emanoil Şerbencu and Viorel Minzu and Adriana Şerbencu and Daniela Cernega},
title={TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2011},
pages={136-141},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003539301360141},
isbn={978-989-8425-74-4},
}
in Bibtex Style
@conference{icinco11,
author={Adrian Emanoil Şerbencu and Viorel Minzu and Adriana Şerbencu and Daniela Cernega},
title={TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2011},
pages={136-141},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003539301360141},
isbn={978-989-8425-74-4},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM
SN - 978-989-8425-74-4
AU - Emanoil Şerbencu A.
AU - Minzu V.
AU - Şerbencu A.
AU - Cernega D.
PY - 2011
SP - 136
EP - 141
DO - 10.5220/0003539301360141
in EndNote Style
TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - TWO ELITIST VARIANTS OF DIFFERENTIAL ANT-STIGMERGY ALGORITHM
SN - 978-989-8425-74-4
AU - Emanoil Şerbencu A.
AU - Minzu V.
AU - Şerbencu A.
AU - Cernega D.
PY - 2011
SP - 136
EP - 141
DO - 10.5220/0003539301360141