{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:49:49Z","timestamp":1760820589300},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,23]],"date-time":"2014-02-23T00:00:00Z","timestamp":1393113600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10878-014-9717-1","type":"journal-article","created":{"date-parts":[[2014,2,22]],"date-time":"2014-02-22T13:52:53Z","timestamp":1393077173000},"page":"95-117","source":"Crossref","is-referenced-by-count":27,"title":["Algorithms for randomized time-varying knapsack problems"],"prefix":"10.1007","volume":"31","author":[{"given":"Yichao","family":"He","sequence":"first","affiliation":[]},{"given":"Xinlu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenbin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Suogang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,23]]},"reference":[{"key":"9717_CR1","volume-title":"Evolutionary computation for modeling and optimization","author":"D Ashlock","year":"2006","unstructured":"Ashlock D (2006) Evolutionary computation for modeling and optimization. Springer, Berlin"},{"issue":"22","key":"9717_CR2","doi-asserted-by":"crossref","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11042\u201311061","journal-title":"Appl Math Comput"},{"key":"9717_CR3","unstructured":"Brassard G, Bratley P (2003) Fundamentals of algorithmics. Prentice Hall, Inc., London"},{"key":"9717_CR4","first-page":"370","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL et al (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge, pp 370\u2013399","edition":"2"},{"issue":"1","key":"9717_CR5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4\u201331","journal-title":"IEEE Trans Evol Comput"},{"key":"9717_CR6","first-page":"11","volume-title":"New ideas in optimization","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Caro G (1999) The ant colony optimization meta-heuristic. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw Hill, London, pp 11\u201332"},{"key":"9717_CR7","volume-title":"Theory of computational complexity","author":"D-Z Du","year":"2000","unstructured":"Du D-Z, Ko K-I (2000) Theory of computational complexity. Wiley-Interscience, New York"},{"key":"9717_CR8","doi-asserted-by":"crossref","unstructured":"Du D-Z, Ko K-I, Hu X (2012) Design and analysis of approximation algorithms. Springer Science Business Media LLC, Berlin","DOI":"10.1007\/978-1-4614-1701-9"},{"key":"9717_CR9","first-page":"4","volume-title":"Parallel solving from nature (PPSN1)","author":"AE Eiben","year":"1991","unstructured":"Eiben AE, Arts EH, Van Hee KM (1991) Global convergence of genetic algorithm: an infinite Markov chain analysis. In: Schwefel HP, Manner R (eds) Parallel solving from nature (PPSN1). Springer, Berlin, pp 4\u201312"},{"key":"9717_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.engappai.2013.09.013","volume":"27","author":"SM Elsayed","year":"2014","unstructured":"Elsayed SM, Sarker RA, Essam DL (2014) A new genetic algorithm for solving optimization problems. Eng Appl Artif Intell 27:57\u201369","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"9717_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1017\/S0890060401020030","volume":"16","author":"Z Ezziane","year":"2002","unstructured":"Ezziane Z (2002) Solving the 0\/1 knapsack problem using an adaptive genetic algorithm. Artif Intell Eng Des Anal Manuf 16(1):23\u201330","journal-title":"Artif Intell Eng Des Anal Manuf"},{"issue":"3","key":"9717_CR12","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","volume":"129","author":"MM Eusuff","year":"2003","unstructured":"Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog-leaping algorithm. J Water Resour Plan Manag 129(3):210\u2013225","journal-title":"J Water Resour Plan Manag"},{"issue":"2","key":"9717_CR13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"key":"9717_CR14","unstructured":"Goldberg DE, Smith RE (1987) Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: International conference on genetic algorithms. L. Erlbaum Associates Inc, Hillsdale, pp 59\u201368"},{"key":"9717_CR15","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, Boston"},{"issue":"1","key":"9717_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J Gottlieb","year":"2002","unstructured":"Gottlieb J, Marchiori E, Rossi C (2002) Evolutionary algorithms for the satisfiability problem. Evol Comput 10(1):35\u201350","journal-title":"Evol Comput"},{"key":"9717_CR17","unstructured":"Hembecker F, Lopes HS (2007) Godoy Jr W (2007) Particle swarm optimization for the multidimensional knapsack problem. In: Adaptive and natural computing algorithms, lecture notes in computer science vol 4431, pp 358\u2013365"},{"key":"9717_CR18","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"key":"9717_CR19","doi-asserted-by":"crossref","unstructured":"Jun S, Jian L (2009) Solving 0-1 knapsack Problems via a hybrid differential evolution. In: Third international symposium on intelligent information technology application vol 3. IITA, pp 134\u2013137","DOI":"10.1109\/IITA.2009.35"},{"key":"9717_CR20","unstructured":"Kang L, Zhou A, Bob M et al. (2004) Benchmarking algorithms for dynamic travelling salesman problems. In: The congress on evolutionary computation. Portland, Oregon"},{"key":"9717_CR21","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks (Perth), vol IV. IEEE Service Center, Piscataway, NJ, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9717_CR22","unstructured":"Krishnakumar K (1989) Micro-genetic algorithms for stationary and non-stationary function optimization. In: SPIE intelligent control and adaptive systems, pp 289\u2013296"},{"issue":"1","key":"9717_CR23","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tcs.2006.03.007","volume":"358","author":"R Kumar","year":"2006","unstructured":"Kumar R, Banerjeec N (2006) Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem. Theor Comput Sci 358(1):104\u2013120","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9717_CR24","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0743-7315(88)90007-X","volume":"5","author":"J Lee","year":"1988","unstructured":"Lee J, Shragowitz E, Sahni S (1988) A hypercube algorithm for the 0\/1 knapsack problem. J Parallel Distrib Comput 5(4):438\u2013456","journal-title":"J Parallel Distrib Comput"},{"key":"9717_CR25","doi-asserted-by":"crossref","unstructured":"Li C, Yang M, Kang L (2006) A new approach to solving dynamic traveling salesman problems. In: Simulated evolution and learning, lecture notes in computer science vol 4247, pp 236\u2013243","DOI":"10.1007\/11903697_31"},{"issue":"2","key":"9717_CR26","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TEVC.2011.2112662","volume":"16","author":"X Li","year":"2012","unstructured":"Li X, Yao X (2012) Cooperatively coevolving particle swarms for large scale optimization. IEEE Trans Evol Comput 16(2):210\u2013224","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"9717_CR27","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.camwa.2011.12.018","volume":"64","author":"Y-F Liao","year":"2012","unstructured":"Liao Y-F, Yau D-H, Chen C-L (2012) Evolutionary algorithm to traveling salesman problems. Comput Math Appl 64(5):788\u2013797","journal-title":"Comput Math Appl"},{"issue":"5","key":"9717_CR28","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/41.538609","volume":"43","author":"KF Man","year":"1996","unstructured":"Man KF, Tang KS, Kwong S (1996) Genetic algorithms: concepts and applications. IEEE Trans Ind Electron 43(5):519\u2013534","journal-title":"IEEE Trans Ind Electron"},{"key":"9717_CR29","unstructured":"Mori N, Kita H, Nishikawa Y (1996) Adaptation to a changing environment by means of the thermodynamical genetic algorithm vol 1141 of LNCS. Springer, Berlin, pp 513\u2013522"},{"issue":"1","key":"9717_CR30","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph G (1994) Convergence analysis of canonical genetic algorithms. IEEE Trans Neural Netw 5(1):86\u2013101","journal-title":"IEEE Trans Neural Netw"},{"key":"9717_CR31","unstructured":"Ryan C (1997) Diploidy without dominance. In: Alander JT (ed) Third nordic workshop on genetic algorithms, pp 63\u201370"},{"key":"9717_CR32","volume-title":"Evolutionary optimization algorithms","author":"D Simon","year":"2013","unstructured":"Simon D (2013) Evolutionary optimization algorithms. Wiley, New York"},{"key":"9717_CR33","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","journal-title":"J Glob Optim"},{"issue":"4","key":"9717_CR34","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"H-K Tsai","year":"2004","unstructured":"Tsai H-K, Yang J-M, Tsai Y-F et al (2004) An evolutionary algorithm for large traveling salesman problems. IEEE Trans Syst Man Cybern Part B 34(4):1718\u20131729","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"11","key":"9717_CR35","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s00500-004-0421-4","volume":"9","author":"AS Uyar","year":"2005","unstructured":"Uyar AS, Harmanci AE (2005) A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments. Soft Comput 9(11):803\u2013814","journal-title":"Soft Comput"},{"issue":"2","key":"9717_CR36","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9717_CR37","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TEVC.2008.2003008","volume":"13","author":"SY Yuen","year":"2009","unstructured":"Yuen SY, Chow CK (2009) A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput 13(2):454\u2013472","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9717-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9717-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9717-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:23Z","timestamp":1559276603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9717-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,23]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9717"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9717-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,23]]}}}