{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T09:33:42Z","timestamp":1776418422222,"version":"3.51.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T00:00:00Z","timestamp":1216339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00500-008-0345-5","type":"journal-article","created":{"date-parts":[[2008,7,17]],"date-time":"2008-07-17T08:16:24Z","timestamp":1216282584000},"page":"725-738","source":"Crossref","is-referenced-by-count":9,"title":["A permutation-based dual genetic algorithm for dynamic optimization problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Lili","family":"Liu","sequence":"first","affiliation":[]},{"given":"Dingwei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"W. H.","family":"Ip","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,18]]},"reference":[{"key":"345_CR1","unstructured":"B\u00e4ck T (1998) On the behavior of evolutionary algorithms in dynamic fitness landscape. In: Proceedings of the 1998 IEEE international conference on evolutionary computation, pp 446\u2013451"},{"issue":"4","key":"345_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TEVC.2005.857074","volume":"10","author":"T Blackwell","year":"2006","unstructured":"Blackwell T, Branke J (2006) Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Trans Evol Comput 10(4): 459\u2013472","journal-title":"IEEE Trans Evol Comput"},{"key":"345_CR3","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 Congress Evol Comput 3: 1875\u20131882","journal-title":"Proc 1999 Congress Evol Comput"},{"key":"345_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0911-0","volume-title":"Evolutionary Optimization in Dynamic Environments","author":"J Branke","year":"2002","unstructured":"Branke J (2002) Evolutionary Optimization in Dynamic Environments. Kluwer, Dordrecht"},{"key":"345_CR5","doi-asserted-by":"crossref","unstructured":"Branke J, Kau\u00dfler Schmidt C, Schmeck H (2000) A Multi-Population Approach to Dynamic Optimization Problems. In: Adaptive Computing in Design and Manufacturing, pp 299\u2013308","DOI":"10.1007\/978-1-4471-0519-0_24"},{"issue":"4","key":"345_CR6","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R Cheng","year":"1996","unstructured":"Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of jobshop scheduling problems using genetic algorithms, Part I: representation. Comput Ind Eng 30(4): 983\u2013997","journal-title":"Comput Ind Eng"},{"key":"345_CR7","doi-asserted-by":"crossref","unstructured":"Cobb HG (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001. Naval Research Laboratory, Washington","DOI":"10.21236\/ADA229159"},{"key":"345_CR8","doi-asserted-by":"crossref","unstructured":"Cobb HG, Grefenstette J (1993) Genetic algorithms for tracking changing environments. In: Proceedings of the 5th international conference on genetic algorithms, pp 523\u2013530","DOI":"10.21236\/ADA294075"},{"key":"345_CR9","unstructured":"Collard P, Aurand JP (1994) DGA: an efficient genetic algorithm. In: Proceedings of the 11th European conference on artificial intelligence, pp 487\u2013491"},{"key":"345_CR10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1142\/S0218213097000323","volume":"6","author":"P Collard","year":"1997","unstructured":"Collard P, Escazut C, Gaspar A (1997) An Evolutionary Approach for Time Dependant Optimization. Int J Artif Intell Tools 6: 665\u2013695","journal-title":"Int J Artif Intell Tools"},{"key":"345_CR11","unstructured":"Dasgupta D, McGregor D (1992) Nonstationary function optimization using structured genetic algorithm. In: Proceedings of the 2nd international conference on parallel problem solving from nature, pp 145\u2013154"},{"key":"345_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.orl.2005.01.010","volume":"34","author":"O Ergun","year":"2006","unstructured":"Ergun O (2006) Fast neighborhood search for the single machine total weighted tardiness problem. Oper Res Lett 34: 41\u201345","journal-title":"Oper Res Lett"},{"key":"345_CR13","volume-title":"Modern algebra with application","author":"WJ Gilbert","year":"1976","unstructured":"Gilbert WJ (1976) Modern algebra with application. Wiley, New York"},{"key":"345_CR14","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. Addison-Wesley, Reading"},{"key":"345_CR15","unstructured":"Goldberg DE, Smith RE (1987) Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Grefenstette JJ (ed) Proceedings of the 2nd international conference on genetic algorithms, pp 59\u201368"},{"key":"345_CR16","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Proceedings of EvoWorkshops 2001. Springer, Berlin, pp 213\u2013222","DOI":"10.1007\/3-540-45365-2_22"},{"key":"345_CR17","unstructured":"Hadad BS, Eick FC (1997) Supporting polyploidy in genetic algorithms using dominance vectors. In: Proceedings of the 6th international conference on evolutionary programming, pp 223\u2013234"},{"key":"345_CR18","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"6","key":"345_CR19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans Evol Comput 9(6): 303\u2013317","journal-title":"IEEE Trans Evol Comput"},{"key":"345_CR20","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","author":"C Koulamas","year":"1994","unstructured":"Koulamas C (1994) The total tardiness problem, review and extensions. Oper Res 42: 1025\u20131041","journal-title":"Oper Res"},{"key":"345_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"P Larra\u00f1aga","year":"2002","unstructured":"Larra\u00f1aga P, Lozano JA (2002) Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Dordrecht"},{"key":"345_CR22","doi-asserted-by":"crossref","unstructured":"Lewis J, Hart E, Ritchie G (1998) A comparison of dominance mechanisms and simple mutation on non-stationary problems. In: Proceedings of the 5th international conference on parallel problem solving from nature, pp 139\u2013148","DOI":"10.1007\/BFb0056857"},{"key":"345_CR23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0272-6963(97)90005-X","volume":"11","author":"NP Lin","year":"1994","unstructured":"Lin NP, Krajewski L, Leong GK, Benton WC (1994) The effects of environmental factors on the design of master production scheduling systems. J Oper Manage 11: 367\u2013384","journal-title":"J Oper Manage"},{"key":"345_CR24","unstructured":"Louis SJ, Xu Z (1996) Genetic algorithms for open shop scheduling and re-scheduling. In: Proceedings of the 11th ISCA international conference on computers and their applications, pp 99\u2013102"},{"key":"345_CR25","unstructured":"Martin I (2003) Algebra. Mechanism Industry Publishing Company"},{"key":"345_CR26","doi-asserted-by":"crossref","unstructured":"Morrison RW, De Jong KA (2000) Triggered hypermutation revisited. In: Proceedings of the 2000 congress on evolutionary computation, pp 1025\u20131032","DOI":"10.1109\/CEC.2000.870759"},{"key":"345_CR27","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/ICSMC.1996.569846","volume":"1","author":"M Munetomo","year":"1996","unstructured":"Munetomo M, Takai Y, Sato Y (1996) On tracking-ability of a stochastic genetic algorithm to changing environments. IEEE Trans Syst Man Cyberetics 1: 522\u2013526","journal-title":"IEEE Trans Syst Man Cyberetics"},{"key":"345_CR28","unstructured":"Ng KP, Wong KC (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimization. In: Proceedings of the 6th international conference on genetic algorithms, pp 159\u2013166"},{"key":"345_CR29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22: 5\u201313","journal-title":"Comput Oper Res"},{"key":"345_CR30","doi-asserted-by":"crossref","first-page":"3055","DOI":"10.1016\/j.cor.2005.11.014","volume":"34","author":"R Swaminathan","year":"2007","unstructured":"Swaminathan R (2007) Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Comput Oper Res 34: 3055\u20133068","journal-title":"Comput Oper Res"},{"key":"345_CR31","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47: 65\u201374","journal-title":"Eur J Oper Res"},{"key":"345_CR32","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64: 278\u201385","journal-title":"Eur J Oper Res"},{"key":"345_CR33","doi-asserted-by":"crossref","unstructured":"Vavak F, Fogarty TC (1996) A comparative study of steady state and generational genetic algorithms for use in nonstationary environments. In: AISB Workshop on Evolutionary Computing, Lecture Notes in Computer Science, vol. 1143, pp 297\u2013304","DOI":"10.1007\/BFb0032791"},{"key":"345_CR34","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","volume":"26","author":"A Vinicius","year":"1999","unstructured":"Vinicius A (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26: 219\u2013235","journal-title":"Comput Oper Res"},{"key":"345_CR35","doi-asserted-by":"crossref","unstructured":"Wang H, Wang D (2006) An improved primal\u2013dual genetic algorithm for optimization in dynamic environments. In: Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 4234, pp 836\u2013844","DOI":"10.1007\/11893295_92"},{"key":"345_CR36","doi-asserted-by":"crossref","first-page":"2246","DOI":"10.1109\/CEC.2003.1299951","volume":"3","author":"S Yang","year":"2003","unstructured":"Yang S (2003) Non-stationary problem optimization using the primal\u2013dual genetic algorithm. Proc 2003 Congress Evol Comput 3: 2246\u20132253","journal-title":"Proc 2003 Congress Evol Comput"},{"key":"345_CR37","first-page":"1115","volume":"2","author":"S Yang","year":"2005","unstructured":"Yang S (2005) Memory-based immigrants for genetic algorithms in dynamic environments. Proc 2005 Genet Evol Comput Conf 2: 1115\u20131122","journal-title":"Proc 2005 Genet Evol Comput Conf"},{"key":"345_CR38","doi-asserted-by":"crossref","unstructured":"Yang S (2006) Associative memory scheme for genetic algorithms in dynamic environments. In: Applications of Evolutionary Computing. Lecture Notes in Computer Science, vol. 3907, pp 788\u2013799","DOI":"10.1007\/11732242_76"},{"issue":"11","key":"345_CR39","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 algorithms for dynamic optimization problems. Soft Comput 9(11): 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-008-0345-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0345-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0345-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:54Z","timestamp":1559093994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0345-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,18]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["345"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0345-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,18]]}}}