{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:55:45Z","timestamp":1742946945097,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78811-7_5","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"45-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Multi-objective Optimization via Sliding Time Window and Parallel Computing"],"prefix":"10.1007","author":[{"given":"Qinqin","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Okan K.","family":"Ersoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenzhong","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"issue":"7","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1007\/s00500-010-0681-0","volume":"15","author":"C Cruz","year":"2011","unstructured":"Cruz, C., Gonz\u00e1lez, J., Pelta, D.: Optimization in dynamic environments: a survey on problems, methods and measures. Soft. Comput. 15(7), 1427\u20131448 (2011)","journal-title":"Soft. Comput."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2013.2248159","volume":"18","author":"S Nguyen","year":"2013","unstructured":"Nguyen, S., Zhang, M., Johnston, M., et al.: Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming. IEEE Trans. Evol. Comput. 18(2), 193\u2013208 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TITS.2015.2499254","volume":"17","author":"X Yan","year":"2015","unstructured":"Yan, X., Cai, B., Ning, B., et al.: Moving horizon optimization of dynamic trajectory planning for high-speed train operation. IEEE Trans. Intell. Transp. Syst. 17(5), 1258\u20131270 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCYB.2013.2253605","volume":"44","author":"A Yazici","year":"2013","unstructured":"Yazici, A., Kirlik, G., Parlaktuna, O., et al.: A dynamic path planning approach for multirobot sensor-based coverage considering energy constraints. IEEE Trans. Cybern. 44, 305\u2013314 (2013)","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2020.06.003","volume":"288","author":"M Karatas","year":"2021","unstructured":"Karatas, M.: A dynamic multi-objective location-allocation model for search and rescue assets. Eur. J. Oper. Res. 288(2), 620\u2013633 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.asoc.2017.05.044","volume":"59","author":"Q Fan","year":"2017","unstructured":"Fan, Q., Wang, W., Yan, X.: Multi-objective differential evolution with performance-metric-based self-adaptive mutation operator for chemical and biochemical dynamic optimization problems. Appl. Soft Comput. 59, 33\u201344 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/TEVC.2017.2771451","volume":"22","author":"M Jiang","year":"2018","unstructured":"Jiang, M., Huang, Z., Qiu, L., et al.: Transfer learning-based dynamic multiobjective optimization algorithms. IEEE Trans. Evol. Comput. 22(4), 501\u2013514 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"R Tanabe","year":"2019","unstructured":"Tanabe, R., Ishibuchi, H.: A review of evolutionary multi-modal multi-objective optimization. IEEE Trans. Evol. Comput. 24(1), 193\u2013200 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"5_CR9","first-page":"524","volume":"38","author":"W Yan","year":"2004","unstructured":"Yan, W., Chang, J., Shao, H.: Least square SVM regression method based on sliding time window and its simulation. J. Shanghai Jiaotong Univ. 38(4), 524\u2013526 (2004)","journal-title":"J. Shanghai Jiaotong Univ."},{"key":"5_CR10","unstructured":"Fan, Q., Yan, X., Zhang, Y., et al.: A variable search space strategy based on sequential trust region determination technique. IEEE Trans. Cybern. PP, 1\u20133 (2019)"},{"key":"5_CR11","unstructured":"Helbig, M., Engelbrecht, A.: Benchmark functions for CEC 2015 special session and competition on dynamic multi-objective optimization. Technical report (2015)"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TEVC.2019.2922834","volume":"24","author":"Q Zhang","year":"2019","unstructured":"Zhang, Q., Yang, S., Jiang, S., et al.: Novel prediction strategies for dynamic multi-objective optimization. IEEE Trans. Evol. Comput. 24(2), 260\u2013274 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"5_CR13","doi-asserted-by":"publisher","first-page":"2862","DOI":"10.1109\/TCYB.2015.2490738","volume":"46","author":"A Muruganantham","year":"2015","unstructured":"Muruganantham, A., Tan, K., Vadakkepat, P.: Evolutionary dynamic multiobjective optimization via Kalman filter prediction. IEEE Trans. Cybern. 46(12), 2862\u20132873 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"E Akrida","year":"2020","unstructured":"Akrida, E., Mertzios, G., Spirakis, P., et al.: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107, 108\u2013123 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.inffus.2019.06.013","volume":"53","author":"C Ma","year":"2020","unstructured":"Ma, C., Li, W., Cao, J., et al.: Adaptive sliding window based activity recognition for assisted livings. Inf. Fusion 53, 55\u201365 (2020)","journal-title":"Inf. Fusion"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0377-2217(89)90106-9","volume":"38","author":"J Ferland","year":"1989","unstructured":"Ferland, J., Fortin, L.: Vehicles scheduling with sliding time windows. Eur. J. Oper. Res. 38(2), 213\u2013226 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1089\/brain.2011.0036","volume":"1","author":"V Kiviniemi","year":"2011","unstructured":"Kiviniemi, V., Vire, T., Remes, J., et al.: A sliding time-window ICA reveals spatial variability of the default mode network in time. Brain Connectivity 1(4), 339\u2013347 (2011)","journal-title":"Brain Connectivity"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(00)00098-9","volume":"131","author":"K Fagerholt","year":"2001","unstructured":"Fagerholt, K.: Ship scheduling with soft time windows: an optimisation based approach. Eur. J. Oper. Res. 131(3), 559\u2013571 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/978-3-540-70928-2_60","volume-title":"Evolutionary Multi-criterion Optimization","author":"K Deb","year":"2007","unstructured":"Deb, K., Rao N., U., Karthik, S.: Dynamic multi-objective optimization and decision-making using modified NSGA-II: a case study on hydro-thermal power scheduling. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 803\u2013817. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_60"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1162\/evco.2008.16.3.385","volume":"16","author":"S Yang","year":"2008","unstructured":"Yang, S.: Genetic algorithms with memory-and elitism-based immigrants in dynamic environments. Evol. Comput. 16(3), 385\u2013416 (2008)","journal-title":"Evol. Comput."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Jiang, S., Kaiser, M., Wan, S., et al.: An empirical study of dynamic triobjective optimisation problems. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 1\u20138 (2018)","DOI":"10.1109\/CEC.2018.8477667"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Branke, J., Kau\u00dfler, T., Smidt, C., et al.: A multi-population approach to dynamic optimization problems. In: Parmee, I.C. (ed.) Evolutionary Design and Manufacture, pp. 299\u2013307: Springer, London (2000). https:\/\/doi.org\/10.1007\/978-1-4471-0519-0_24","DOI":"10.1007\/978-1-4471-0519-0_24"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.ejor.2017.03.048","volume":"261","author":"R Liu","year":"2017","unstructured":"Liu, R., Li, J., Mu, C., et al.: A coevolutionary technique based on multi-swarm particle swarm optimization for dynamic multi-objective optimization. Eur. J. Oper. Res. 261(3), 1028\u20131051 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR24","unstructured":"Branke, S.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 Conference on Evolutionary Computation, pp. 1875\u20131882 (1999)"},{"issue":"1","key":"5_CR25","first-page":"103","volume":"13","author":"C Goh","year":"2008","unstructured":"Goh, C., Tan, K.: A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE Trans. Evol. Comput. 13(1), 103\u2013127 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/4235.910466","volume":"5","author":"P Stroud","year":"2001","unstructured":"Stroud, P.: Kalman-extended genetic algorithm for search in nonstationary environments with noisy fitness evaluations. IEEE Trans. Evol. Comput. 5(1), 66\u201377 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.2008.16.1.1","volume":"16","author":"C Rossi","year":"2008","unstructured":"Rossi, C., Abderrahim, M., D\u00edaz, J.: Tracking moving optima using Kalman-based predictions. Evol. Comput. 16(1), 1\u201330 (2008)","journal-title":"Evol. Comput."},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCYB.2013.2245892","volume":"44","author":"A Zhou","year":"2013","unstructured":"Zhou, A., Jin, Y., Zhang, Q.: A population prediction strategy for evolutionary dynamic multiobjective optimization. IEEE Trans. Cybern. 44(1), 40\u201353 (2013)","journal-title":"IEEE Trans. Cybern."},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Ruan, G., Minku, L., Menzel, S., et al.: When and how to transfer knowledge in dynamic multi-objective optimization. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 2034\u20132041 (2019)","DOI":"10.1109\/SSCI44817.2019.9002815"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"106592","DOI":"10.1016\/j.asoc.2020.106592","volume":"96","author":"F Wang","year":"2020","unstructured":"Wang, F., Li, Y., Liao, F., Yan, H.: An ensemble learning based prediction strategy for dynamic multi-objective optimization. Appl. Soft Comput. 96, 106592 (2020)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"5_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q Zhang","year":"2008","unstructured":"Zhang, Q., Zhou, A., Jin, Y.: RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans. Evol. Comput. 12(1), 41\u201363 (2008)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78811-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:22:34Z","timestamp":1625613754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}