Abstract
Diploid genetic algorithms (DGAs) promise robustness as against simple genetic algorithms which only work towards optimization. Moreover, these algorithms outperform others in dynamic environments. The work examines the theoretical aspect of the concept by examining the existing literature. The present work takes the example of dynamic TSP to compare greedy approach, genetic algorithms and DGAs. The work also implements a greedy genetic approach for the problem. In the experiments carried out, the three variants of dominance were implemented and 115 runs proved the point that none of them outperforms the other.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bhasin H, Singla N (2012a) Harnessing cellular automata and genetic algorithms to solve TSP. In: International conference on information, computing and telecommunications (ICICT’12), pp 72–77
Bhasin H, Singla N (2012b) Genetic based algorithm for N-puzzle problem. Int J Comput Appl 51(22):44–50
Bhasin H et al (2014) On the applicability of diploid genetic algorithms in dynamic environments. In: Proceedings of the international conference on soft computing and machine intelligence (ISCMI’14). IEEE Computer Society, Washington, DC, pp 94–97. doi:10.1109/ISCMI.2014.27
Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. Proc 1999 Congr Evol Comput 3:1875–1882
Eyckelhof CJ, Snoek M (2002) Ant systems for a dynamic TSP. In: Proceedings of the 3rd international workshop on ant algorithms. Springer, New York, pp 88–99
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston
Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Evo workshops 2001: applications of evolutionary computing. Springer, New York, pp 213–222
Guntsch M, Middendorf M, Schmeck H (2001) An ant colony optimization approach to dynamic TSP. In: Proceedings of the 2001 genetic and evolutionary computing conference, pp 860–867
Guo T, Michalewicz Z (1998) Inver-over operator for the TSP. In: Proceedings of the 5th international conference on parallel problem solving from nature, pp 803–812
Ng KP, Wong KC (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimization. In: Eshelman LJ (ed) Proceedings of the 6th international conference on genetic algorithms. Morgan Kaufmann Publishers Inc., San Francisco, pp 159–166
Paulinas M, Ušinskas A (2007) A survey of genetic algorithms applications for image enhancement and segmentation. Inf Technol Control 36(3):278–284
Ryan C (1994) Degree of oneness. In: Proceedings of the 1994, ECAI workshop of genetic algorithm
Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17–26
Yang S, Yao X (2005) Experimental study on population-based incremental learning algorithm for dynamic optimization problem. Soft Comput 9:815–834
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by S. Deb, T. Hanne and S. Fong.
Rights and permissions
About this article
Cite this article
Bhasin, H., Behal, G., Aggarwal, N. et al. On the applicability of diploid genetic algorithms in dynamic environments. Soft Comput 20, 3403–3410 (2016). https://doi.org/10.1007/s00500-015-1803-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1803-5