{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:03:02Z","timestamp":1773327782787,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031466601","type":"print"},{"value":"9783031466618","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46661-8_30","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"447-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Preference-Based Indicator Selection Hyper-Heuristic for\u00a0Optimization Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6474-3810","authenticated-orcid":false,"given":"Adeem Ali","family":"Anwar","sequence":"first","affiliation":[]},{"given":"Irfan","family":"Younas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8980-4950","authenticated-orcid":false,"given":"Guanfeng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xuyun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Adriaensen, S., Ochoa, G., Now\u00e9, A.: A benchmark set extension and comparative study for the hyflex framework. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 784\u2013791. IEEE (2015)","DOI":"10.1109\/CEC.2015.7256971"},{"issue":"01","key":"30_CR2","doi-asserted-by":"publisher","first-page":"2050003","DOI":"10.1142\/S0218213020500037","volume":"29","author":"AA Anwar","year":"2020","unstructured":"Anwar, A.A., Younas, I.: Optimization of many objective pickup and delivery problem with delay time of vehicle using memetic decomposition based evolutionary algorithm. Int. J. Artif. Intell. Tools 29(01), 2050003 (2020)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-031-22137-8_23","volume-title":"Advanced Data Mining and Applications: 18th International Conference, ADMA 2022, Brisbane, QLD, Australia, November 28\u201330, 2022, Proceedings, Part II","author":"AA Anwar","year":"2022","unstructured":"Anwar, A.A., Younas, I., Liu, G., Beheshti, A., Zhang, X.: A cricket-based selection hyper-heuristic for\u00a0many-objective optimization problems. In: Chen, W., Yao, L., Cai, T., Pan, S., Shen, T., Li, X. (eds.) Advanced Data Mining and Applications: 18th International Conference, ADMA 2022, Brisbane, QLD, Australia, November 28\u201330, 2022, Proceedings, Part II, pp. 310\u2013324. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22137-8_23"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TEVC.2014.2339823","volume":"19","author":"M Asafuddoula","year":"2014","unstructured":"Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445\u2013460 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: optimal $$\\mu $$-distributions and the choice of the reference point. In: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pp. 87\u2013102 (2009)","DOI":"10.1145\/1527125.1527138"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 449\u2013468. Springer US, Boston, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_15"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization, pp. 105\u2013145. Springer-Verlag, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"key":"30_CR10","unstructured":"Derigs, U.: Optimization and operations research-Volume IV. EOLSS Publications (2009)"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake, J.H., Kheiri, A., \u00d6zcan, E., Burke, E.K.: Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285(2), 405\u2013428 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer Berlin Heidelberg, Berlin, Heidelberg (2003)"},{"issue":"2","key":"30_CR13","first-page":"146","volume":"39","author":"S Fatemi-Anaraki","year":"2022","unstructured":"Fatemi-Anaraki, S., Mokhtarzadeh, M., Rabbani, M., Abdolhamidi, D.: A hybrid of k-means and genetic algorithm to solve a bi-objective green delivery and pick-up problem. J. Ind. Prod. Eng. 39(2), 146\u2013157 (2022)","journal-title":"J. Ind. Prod. Eng."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Fritsche, G., Pozo, A.: Cooperative based hyper-heuristic for many-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 550\u2013558 (2019)","DOI":"10.1145\/3321707.3321740"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Fritsche, G., Pozo, A.: The analysis of a cooperative hyper-heuristic on a constrained real-world many-objective continuous problem. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185904"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31880-4_20","volume-title":"Evolutionary Multi-Criterion Optimization","author":"S Huband","year":"2005","unstructured":"Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) Evolutionary Multi-Criterion Optimization, pp. 280\u2013295. Springer Berlin Heidelberg, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_20"},{"issue":"1","key":"30_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TEVC.2017.2785346","volume":"23","author":"W Li","year":"2017","unstructured":"Li, W., \u00d6zcan, E., John, R.: A learning automata-based multiobjective hyper-heuristic. IEEE Trans. Evol. Comput. 23(1), 59\u201373 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Liefooghe, A., Derbel, B.: A correlation analysis of set quality indicator values in multiobjective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 581\u2013588 (2016)","DOI":"10.1145\/2908812.2908906"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Masood, A., Chen, G., Zhang, M.: Feature selection for evolving many-objective job shop scheduling dispatching rules with genetic programming. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 644\u2013651. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504895"},{"key":"30_CR20","unstructured":"Moea framework. http:\/\/moeaframework.org\/. Accessed 25 Mar 2023"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Perwaiz, U., Younas, I., Anwar, A.A.: Many-objective bat algorithm. Plos one 15(6), e0234625 (2020)","DOI":"10.1371\/journal.pone.0234625"},{"key":"30_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107252","volume":"156","author":"W Qin","year":"2021","unstructured":"Qin, W., Zhuang, Z., Huang, Z., Huang, H.: A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem. Comput. Indust. Eng. 156, 107252 (2021)","journal-title":"Comput. Indust. Eng."},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American Computing Conference (CLEI), pp. 1\u201311. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search Methodologies","author":"P Ross","year":"2005","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 529\u2013556. Springer US, Boston, MA (2005). https:\/\/doi.org\/10.1007\/0-387-28356-0_17"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, M., Cruz-Duarte, J.M., carlos Ort\u00edz-Bayliss, J., Ceballos, H., Terashima-Marin, H., Amaya, I.: A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access 8, 128068\u2013128095 (2020)","DOI":"10.1109\/ACCESS.2020.3009318"},{"key":"30_CR26","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-030-91702-9_12","volume-title":"Intelligent Systems: 10th Brazilian Conference, BRACIS 2021, Virtual Event, November 29 \u2013 December 3, 2021, Proceedings, Part I","author":"BNK Senzaki","year":"2021","unstructured":"Senzaki, B.N.K., Venske, S.M., Almeida, C.P.: Hyper-heuristic based NSGA-III for the many-objective quadratic assignment problem. In: Britto, A., Valdivia Delgado, K. (eds.) Intelligent Systems: 10th Brazilian Conference, BRACIS 2021, Virtual Event, November 29 \u2013 December 3, 2021, Proceedings, Part I, pp. 170\u2013185. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91702-9_12"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"S. S., V.C., H. S., A.: Nature inspired meta heuristic algorithms for optimization problems. Computing 104, 251\u2013269 (2021). https:\/\/doi.org\/10.1007\/s00607-021-00955-5","DOI":"10.1007\/s00607-021-00955-5"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Venske, S.M., Almeida, C.P., Delgado, M.R.: Comparing selection hyper-heuristics for many-objective numerical optimization. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1921\u20131928. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504934"},{"key":"30_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-652-8","volume-title":"Multi-objective Evolutionary Optimisation for Product Design and Manufacturing","year":"2011","unstructured":"Wang, L., Ng, A.H.C., Deb, K. (eds.): Multi-objective Evolutionary Optimisation for Product Design and Manufacturing. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-0-85729-652-8"},{"issue":"2","key":"30_CR30","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s40747-020-00230-8","volume":"7","author":"T Yang","year":"2021","unstructured":"Yang, T., Zhang, S., Li, C.: A multi-objective hyper-heuristic algorithm based on adaptive epsilon-greedy selection. Complex Intell. Syst. 7(2), 765\u2013780 (2021)","journal-title":"Complex Intell. Syst."},{"issue":"6","key":"30_CR31","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46661-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:06:20Z","timestamp":1699103180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46661-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466601","9783031466618"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46661-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","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":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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":"43% - 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.97","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.77","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)"}}]}}