{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:51:18Z","timestamp":1767772278562},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T00:00:00Z","timestamp":1438300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00500-015-1803-5","type":"journal-article","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T15:00:44Z","timestamp":1438268444000},"page":"3403-3410","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On the applicability of diploid genetic algorithms in dynamic environments"],"prefix":"10.1007","volume":"20","author":[{"given":"Harsh","family":"Bhasin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gitanshu","family":"Behal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimish","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj Kumar","family":"Saini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivani","family":"Choudhary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,31]]},"reference":[{"key":"1803_CR1","unstructured":"Bhasin H, Singla N (2012a) Harnessing cellular automata and genetic algorithms to solve TSP. In: International conference on information, computing and telecommunications (ICICT\u201912), pp 72\u201377"},{"issue":"22","key":"1803_CR2","first-page":"44","volume":"51","author":"H Bhasin","year":"2012","unstructured":"Bhasin H, Singla N (2012b) Genetic based algorithm for N-puzzle problem. Int J Comput Appl 51(22):44\u201350","journal-title":"Int J Comput Appl"},{"key":"1803_CR3","doi-asserted-by":"publisher","unstructured":"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\u201914). IEEE Computer Society, Washington, DC, pp 94\u201397. doi: 10.1109\/ISCMI.2014.27","DOI":"10.1109\/ISCMI.2014.27"},{"key":"1803_CR4","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1109\/CEC.1999.785502","volume":"3","author":"J Branke","year":"1999","unstructured":"Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. Proc 1999 Congr Evol Comput 3:1875\u20131882","journal-title":"Proc 1999 Congr Evol Comput"},{"key":"1803_CR5","doi-asserted-by":"crossref","unstructured":"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\u201399","DOI":"10.1007\/3-540-45724-0_8"},{"key":"1803_CR6","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston","edition":"1"},{"key":"1803_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013222","DOI":"10.1007\/3-540-45365-2_22"},{"key":"1803_CR8","unstructured":"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\u2013867"},{"key":"1803_CR9","unstructured":"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\u2013812"},{"key":"1803_CR10","unstructured":"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\u2013166"},{"key":"1803_CR11","unstructured":"Paulinas M, U\u0161inskas A (2007) A survey of genetic algorithms applications for image enhancement and segmentation. Inf Technol Control 36(3):278\u2013284"},{"key":"1803_CR12","unstructured":"Ryan C (1994) Degree of oneness. In: Proceedings of the 1994, ECAI workshop of genetic algorithm"},{"issue":"6","key":"1803_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17\u201326","journal-title":"Computer"},{"key":"1803_CR14","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang S, Yao X (2005) Experimental study on population-based incremental learning algorithm for dynamic optimization problem. Soft Comput 9:815\u2013834","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1803-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1803-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1803-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:50Z","timestamp":1559094230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1803-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,31]]},"references-count":14,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1803"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1803-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,31]]}}}