{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:23:33Z","timestamp":1743117813652,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811941085"},{"type":"electronic","value":"9789811941092"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-981-19-4109-2_27","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:38:26Z","timestamp":1659364706000},"page":"283-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New High-Dimensional Particle Swarm Evolution Algorithm Based on New Fitness Allocation and Multi-criteria Strategy"],"prefix":"10.1007","author":[{"given":"Weiwei","family":"Yu","sequence":"first","affiliation":[]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chengwang","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"issue":"23","key":"27_CR1","doi-asserted-by":"publisher","first-page":"7833","DOI":"10.1007\/s00500-018-3499-9","volume":"22","author":"F Wang","year":"2018","unstructured":"Wang, F., Zhang, H., Li, Y., Zhao, Y., Rao, Q.: External archive matching strategy for MOEA\/D. Soft. Comput. 22(23), 7833\u20137846 (2018). https:\/\/doi.org\/10.1007\/s00500-018-3499-9","journal-title":"Soft. Comput."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.asoc.2017.07.034","volume":"61","author":"W Hongrun","year":"2017","unstructured":"Hongrun, W., Kuang, L., Wang, F., Rao, Q., Gong, M., Li, Y.: A multiobjective box-covering algorithm for fractal modularity on complex networks. Appl. Soft Comput. 61, 294\u2013313 (2017)","journal-title":"Appl. Soft Comput."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks, pp. 1942\u20131948. Perth, WA, Australia (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1162\/EVCO_a_00104","volume":"22","author":"NA Moubayed","year":"2014","unstructured":"Moubayed, N.A., Petrovski, A., Mccall, J.: D2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces. Evol. Comput. 22(1), 47\u201377 (2014)","journal-title":"Evol. Comput."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.asoc.2018.02.011","volume":"66","author":"M Kaur","year":"2018","unstructured":"Kaur, M., Kadam, S.: A novel multi-objective bacteria foraging optimization algorithm (MOBFOA) for multi-objective scheduling. Appl. Soft Comput. 66, 183\u2013195 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.4018\/IJCINI.2019010104","volume":"13","author":"K Li","year":"2019","unstructured":"Li, K., Liang, Z., et al.: Performance analyses of differential evolution algorithm based on dynamic fitness landscape. Int. J. Cogn. Inf. Nat. Intell. (IJCINI) 13(1), 36\u201361 (2019)","journal-title":"Int. J. Cogn. Inf. Nat. Intell. (IJCINI)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ins.2018.12.006","volume":"481","author":"K Li","year":"2019","unstructured":"Li, K., Wang, H.: A mobile node localization algorithm based on an overlapping self-adjustment mechanism. Inf. Sci. 481, 635\u2013649 (2019)","journal-title":"Inf. Sci."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.swevo.2017.07.005","volume":"38","author":"K Li","year":"2018","unstructured":"Li, K., Chen, Y., et al.: Improved gene expression programming to solve the inverse problem for ordinary differential equations. Swarm Evol. Comput. 38, 231\u2013239 (2018)","journal-title":"Swarm Evol. Comput."},{"issue":"12","key":"27_CR9","doi-asserted-by":"publisher","first-page":"3193","DOI":"10.1007\/s00500-015-2003-z","volume":"21","author":"F Wang","year":"2017","unstructured":"Wang, F., Zhang, Y., Rao, Q., Zhang, H.: Exploring mutual information based sentimental analysis with kernel based extreme learning machine for stock prediction. Soft. Comput. 21(12), 3193\u20133205 (2017)","journal-title":"Soft. Comput."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ins.2018.01.027","volume":"436\u2013437","author":"F Wang","year":"2018","unstructured":"Wang, F., Zhang, H., Li, K., Lin, Z., Yang, J., Shen, X.-L.: A hybrid particle swarm optimization algorithm using adaptive learning strategy. Inf. Sci. 436\u2013437, 162\u2013177 (2018)","journal-title":"Inf. Sci."},{"issue":"24","key":"27_CR11","first-page":"56","volume":"44","author":"YF Zhang","year":"2008","unstructured":"Zhang, Y.F., Xue, Q.S., Xiong, Z.Y.: Dynamic particle swarm optimization based on tabu search. Comput. Eng. Appl. 44(24), 56\u201358 (2008)","journal-title":"Comput. Eng. Appl."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cie.2015.07.003","volume":"99","author":"RS Kumar","year":"2016","unstructured":"Kumar, R.S., Kondapaneni, K., Dixit, V., Goswami, A., Thakur, L., Tiwari, M.: Multi-objective modeling of production and pollution routing problem with time window: a self-learning particle swarm optimization approach. Comput. Ind. Eng. 99, 29\u201340 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.swevo.2019.06.009","volume":"49","author":"F Wang","year":"2019","unstructured":"Wang, F., Li, Y., Zhang, H., Ting, H., Shen, X.-L.: An adaptive weight vector guided evolutionary algorithm for preference-based multi-objective optimization. Swarm Evol. Comput. 49, 220\u2013233 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, J., Wang, F., Xu, J., Yan, Y., Zhu, H.: A novel character segmentation method for serial number on banknotes with complex background. J. Ambient Intell. Humanized Comput. 1\u201315 (2018)","DOI":"10.1007\/s12652-018-0707-5"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Lee, K.B., Kim, J.H.: Multi-objective particle swarm optimization with preference-based sorting. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2011, New Orleans, LA, USA, 5\u20138 June 2011. IEEE (2011)","DOI":"10.1109\/CEC.2011.5949929"},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ejor.2011.07.013","volume":"216","author":"I Kaliszewski","year":"2012","unstructured":"Kaliszewski, I., Miroforidis, J., Podkopaev, D.: Interactive multiple criteria decision making based on preference driven evolutionary multi-objective optimization with controllable accuracy. Eur. J. Oper. Res. 216(1), 188\u2013199 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. 137(1), 50\u201371 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"08","key":"27_CR18","first-page":"1227","volume":"12","author":"X Wei Zhong","year":"2006","unstructured":"Wei Zhong, X., Xiaofei, D.S.: Evolutionary algorithm for multi-objective hybrid flow shop job scheduling. Comput. Integr. Manuf. Syst. 12(08), 1227\u20131234 (2006)","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Li, H., Ding, M., Deng, J., et al.: On the use of random weights in MOEA\/D. In: 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE (2015)","DOI":"10.1109\/CEC.2015.7256996"},{"issue":"3","key":"27_CR20","first-page":"185","volume":"36","author":"MC Dadid","year":"2014","unstructured":"Dadid, M.C., Cihan, H.D.: Computational complexity measures for many-objective optimization problem. Procedia Comput. Sci. 36(3), 185\u2013191 (2014)","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"27_CR21","first-page":"201","volume":"39","author":"Y Meng","year":"2014","unstructured":"Meng, Y., Yang, S., Shi, P.: Multi-objective optimization of emergency evacuation using improved genetic algorithm. Wuhan Daxue Xuebao 39(2), 201\u2013205 (2014)","journal-title":"Wuhan Daxue Xuebao"},{"key":"27_CR22","unstructured":"Qiu, F.Y., Mo, L.P., Jian, B., Wang, L.P.: Multi-objective particle swarm optimization algorithm using large scale variable decomposition. Chin. J. Comput. 38(108) (2015)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Bin, J.: Job shop scheduling based on an improved cooperative particle swarm optimization (2010)","DOI":"10.1109\/ICMTMA.2010.473"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Qing, G., Shi-jie, Z., Juan, C.: Parameter tuning of linear active disturbance rejection controller based on chaotic quantum behaved particle swarm optimization. In: 2017 29th Chinese Control and Decision Conference (CCDC). IEEE (2017)","DOI":"10.1109\/CCDC.2017.7978539"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Guo, J., Wang, B.: Particle swarm optimization with Gaussian disturbance. In: 2017 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII). IEEE Computer Society (2017)","DOI":"10.1109\/ICIICII.2017.81"},{"issue":"3","key":"27_CR26","first-page":"435","volume":"32","author":"J-M Yang","year":"2017","unstructured":"Yang, J.-M., Mu, X.-W., Che, H.-J., et al.: Improved multi-objective particle swarm optimization algorithm based on multiple strategies. Kongzhi Yu Juece\/control Decis. 32(3), 435\u2013442 (2017)","journal-title":"Kongzhi Yu Juece\/control Decis."},{"key":"27_CR27","unstructured":"Lyu, L., Ji, W.: Improved particle swarm optimization algorithm combined centroid and Cauchy mutation. J. Comput. Appl. (2017)"},{"issue":"3","key":"27_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1504\/IJBRA.2016.078236","volume":"12","author":"S Saha","year":"2016","unstructured":"Saha, S., Seal, D.B., Ghosh, A., et al.: A novel gene ranking method using Wilcoxon rank sum test and genetic algorithm. Int. J. Bioinf. Res. Appl. 12(3), 263\u2013279 (2016)","journal-title":"Int. J. Bioinf. Res. Appl."}],"container-title":["Communications in Computer and Information Science","Exploration of Novel Intelligent Optimization Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-4109-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T12:01:09Z","timestamp":1727697669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-4109-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811941085","9789811941092"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-4109-2_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISICA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligence Computation and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Giangzhou","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":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 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":"isica2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.scau.edu.cn\/isica2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"99","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":"48","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":"48% - 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":"3","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":"3","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)"}}]}}