{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:15:57Z","timestamp":1763727357804},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992525"},{"type":"electronic","value":"9783319992532"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99253-2_13","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T10:14:41Z","timestamp":1534846481000},"page":"158-169","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Vahid","family":"Roostapour","sequence":"first","affiliation":[]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"A Eiben","year":"2007","unstructured":"Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44874-8","edition":"2"},{"issue":"6","key":"13_CR2","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TEVC.2011.2180533","volume":"16","author":"T Nguyen","year":"2012","unstructured":"Nguyen, T., Yao, X.: Continuous dynamic constrained optimization: the challenges. IEEE Trans. Evol. Comput. 16(6), 769\u2013786 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.swevo.2016.09.002","volume":"33","author":"P Rakshit","year":"2017","unstructured":"Rakshit, P., Konar, A., Das, S.: Noisy evolutionary optimization algorithms - a comprehensive survey. Swarm Evol. Comput. 33, 18\u201345 (2017)","journal-title":"Swarm Evol. Comput."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-319-77538-8_55","volume-title":"Applications of Evolutionary Computation","author":"M-Y Ameca-Alducin","year":"2018","unstructured":"Ameca-Alducin, M.-Y., Hasani-Shoreh, M., Neumann, F.: On the use of repair methods in differential evolution for dynamic constrained optimization. In: Sim, K., Kaufmann, P. (eds.) EvoApplications 2018. LNCS, vol. 10784, pp. 832\u2013847. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77538-8_55"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Pourhassan, M., Gao, W., Neumann, F.: Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 903\u2013910. ACM (2015)","DOI":"10.1145\/2739480.2754700"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Shi, F., Schirneck, M., Friedrich, T., K\u00f6tzing, T., Neumann, F.: Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1407\u20131414. ACM (2017)","DOI":"10.1145\/3071178.3071270"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of Conference on Genetic and Evolutionary Computation, pp. 477\u2013484. ACM (2014)","DOI":"10.1145\/2576768.2598249"},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9781118165881","volume-title":"Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach","author":"GW Corder","year":"2009","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach. Wiley, Hoboken (2009)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99253-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T10:21:58Z","timestamp":1534846918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99253-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992525","9783319992532"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99253-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}