{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T11:51:11Z","timestamp":1776081071728,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030726980","type":"print"},{"value":"9783030726997","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-72699-7_16","type":"book-chapter","created":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T15:03:24Z","timestamp":1617203004000},"page":"242-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Search Efficiency and Diversity of Solutions in Multiobjective Binary Optimization by Using Metaheuristics Plus Integer Linear Programming"],"prefix":"10.1007","author":[{"given":"Miguel \u00c1ngel","family":"Dom\u00ednguez-R\u00edos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5520-8875","authenticated-orcid":false,"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Asafuddoula, M., Ray, T., Sarker, R., Alam, K.: An adaptive constraint handling approach embedded MOEA\/D. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6252868"},{"issue":"1","key":"16_CR2","first-page":"21","volume":"16","author":"MO Ball","year":"2011","unstructured":"Ball, M.O.: Heuristics based on mathematical programming. Surv. Oper. Res. Manage. Sci. 16(1), 21\u201338 (2011)","journal-title":"Surv. Oper. Res. Manage. Sci."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Blum, C., Pereira, J.: Extension of the CMSA algorithm: an LP-based way for reducing sub-instances. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 285\u2013292 (2016)","DOI":"10.1145\/2908812.2908830"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve and adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","volume-title":"Hybrid Metaheuristics","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., Boluf\u00e9 R\u00f6hler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171\u2013177. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04918-7_13"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Chalmet, L., Lemonidis, L., Elzinga, D.: An algorithm for the bi-criterion integer programming problem. Eur. J. Oper. Res. 25(2), 292\u2013300 (1986). https:\/\/doi.org\/10.1016\/0377-2217(86)90093-7","DOI":"10.1016\/0377-2217(86)90093-7"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Tinos, R.: Efficient hill climber for constrained pseudo-boolean optimization problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 309\u2013316 (2016)","DOI":"10.1145\/2908812.2908869"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10898-014-0205-z","volume":"61","author":"K D\u00e4chert","year":"2014","unstructured":"D\u00e4chert, K., Klamroth, K.: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Global Optim. 61(4), 643\u2013676 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0205-z","journal-title":"J. Global Optim."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_83"},{"issue":"10","key":"16_CR10","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo, J.J., Nebro, A.J.: jMetal: a java framework for multi-objective optimization. Adv. Eng. Softw. 42(10), 760\u2013771 (2011)","journal-title":"Adv. Eng. Softw."},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Ehrgott, M., Tenfelde-Podehl, D.: Computation of ideal and nadir values and implications for their use in MCDM methods. Eur. J. Oper. Res. 151(1), 119\u2013139 (2003). https:\/\/doi.org\/10.1016\/S0377-2217(02)00595-7","DOI":"10.1016\/S0377-2217(02)00595-7"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Fonseca, C.M., Paquete, L., L\u00f3pez-Ib\u00e1\u00f1ez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: Proceedings of the IEEE Congress on Evolutionary Computation, 2006. CEC 2006, pp. 1157\u20131163. IEEE (2006). https:\/\/doi.org\/10.1109\/CEC.2006.1688440","DOI":"10.1109\/CEC.2006.1688440"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Jiang, S., Ong, Y.S., Zhang, J., Feng, L.: Consistencies and contradictions of performance metrics in multiobjective optimization. IEEE Trans. Cybern. 44(12), 2391\u20132404 (2014). https:\/\/doi.org\/10.1109\/TCYB.2014.2307319","DOI":"10.1109\/TCYB.2014.2307319"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Kirlik, G., Say\u0131n, S.: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3), 479\u2013488 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.08.001","DOI":"10.1016\/j.ejor.2013.08.001"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Klamroth, K., Lacour, R., Vanderpooten, D.: On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3), 767\u2013778 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2015.03.031","DOI":"10.1016\/j.ejor.2015.03.031"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3300148","volume":"52","author":"M Li","year":"2019","unstructured":"Li, M., Yao, X.: Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput. Surv. 52(2), 1\u201338 (2019)","journal-title":"ACM Comput. Surv."},{"key":"16_CR17","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":"16_CR18","doi-asserted-by":"publisher","unstructured":"Liu, Q., Li, X., Liu, H., Guo, Z.: Multi-objective metaheuristics for discrete optimization problems: a review of the state-of-the-art. Appl. Soft Comput. 93, 106382 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2020.106382","DOI":"10.1016\/j.asoc.2020.106382"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatically improving the anytime behaviour of optimisation algorithms. Eur. J. Oper. Res. 235(3), 569\u2013582 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.10.043","DOI":"10.1016\/j.ejor.2013.10.043"},{"key":"16_CR20","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","volume":"1","author":"E Mezura-Montes","year":"2011","unstructured":"Mezura-Montes, E., Coello Coello, C.A.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol. Comput. 1(4), 173\u2013194 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.10.001","journal-title":"Swarm Evol. Comput."},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86\u201395 (2012). https:\/\/doi.org\/10.1109\/TEVC.2010.2077298","DOI":"10.1109\/TEVC.2010.2077298"},{"issue":"6","key":"16_CR23","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."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/978-3-540-70928-2_64","volume-title":"Evolutionary Multi-Criterion Optimization","author":"E Zitzler","year":"2007","unstructured":"Zitzler, E., Brockhoff, D., Thiele, L.: The hypervolume indicator revisited: on the design of pareto-compliant indicators via weighted integration. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 862\u2013876. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_64"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. TIK-report 103 (2001). https:\/\/doi.org\/10.3929\/ethz-a-004284029","DOI":"10.3929\/ethz-a-004284029"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms-a comparative case study. In: International Conference on Parallel Problem Solving from Nature, pp. 292\u2013301. Springer (1998). https:\/\/doi.org\/10.1007\/BFb0056872","DOI":"10.1007\/BFb0056872"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003). https:\/\/doi.org\/10.1109\/TEVC.2003.810758","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72699-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T15:06:08Z","timestamp":1617203168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72699-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030726980","9783030726997"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72699-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evoapps\/","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":"78","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":"51","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":"65% - 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.38","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":"2.04","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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}