{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:15:46Z","timestamp":1743045346707,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031065262"},{"type":"electronic","value":"9783031065279"}],"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-3-031-06527-9_13","type":"book-chapter","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T23:03:26Z","timestamp":1653347006000},"page":"130-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Building Heuristics and\u00a0Ensembles for\u00a0the\u00a0Travel Salesman Problem"],"prefix":"10.1007","author":[{"given":"Francisco J.","family":"Gil-Gala","sequence":"first","affiliation":[]},{"given":"Marko","family":"\u0110urasevi\u0107","sequence":"additional","affiliation":[]},{"given":"Mar\u00eda R.","family":"Sierra","sequence":"additional","affiliation":[]},{"given":"Ramiro","family":"Varela","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,24]]},"reference":[{"unstructured":"TSP Test Data. http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html. Accessed 1 Feb 2021","key":"13_CR1"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1162\/EVCO_a_00131","volume":"23","author":"J Branke","year":"2015","unstructured":"Branke, J., Hildebrandt, T., Scholz-Reiter, B.: Hyper-heuristic evolution of dispatching rules: a comparison of rule representations. Evol. Comput. 23(2), 249\u2013277 (2015)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Duflo, G., Kieffer, E., Brust, M.R., Danoy, G., Bouvry, P.: A GP hyper-heuristic approach for generating TSP heuristics. In: IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, pp. 521\u2013529 (2019)","key":"13_CR3","DOI":"10.1109\/IPDPSW.2019.00094"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"107606","DOI":"10.1016\/j.asoc.2021.107606","volume":"110","author":"M \u0110umi\u0107","year":"2021","unstructured":"\u0110umi\u0107, M., Jakobovi\u0107, D.: Ensembles of priority rules for resource constrained project scheduling problem. Appl. Soft Comput. 110, 107606 (2021)","journal-title":"Appl. Soft Comput."},{"doi-asserted-by":"publisher","unstructured":"\u0110urasevi\u0107, M., Jakobovi\u0107, D.: Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment. Genet. Program. Evolvable Mach. 19, 53\u201392 (2017). https:\/\/doi.org\/10.1007\/s10710-017-9302-3","key":"13_CR5","DOI":"10.1007\/s10710-017-9302-3"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s10732-019-09416-x","volume":"25","author":"M Durasevi\u0107","year":"2019","unstructured":"Durasevi\u0107, M., Jakobovi\u0107, D.: Creating dispatching rules by simple ensemble combination. J. Heuristics 25, 959\u20131013 (2019)","journal-title":"J. Heuristics"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.asoc.2016.07.025","volume":"48","author":"M Durasevi\u0107","year":"2016","unstructured":"Durasevi\u0107, M., Jakobovi\u0107, D., Kne\u017eevi\u0107, K.: Adaptive scheduling on unrelated machines with genetic programming. Appl. Soft Comput. 48, 419\u2013430 (2016)","journal-title":"Appl. Soft Comput."},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105782","volume":"85","author":"FJ Gil-Gala","year":"2019","unstructured":"Gil-Gala, F.J., Menc\u00eda, C., Sierra, M.R., Varela, R.: Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time. Appl. Soft Comput. 85, 105782 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/ICA-200634","volume":"28","author":"FJ Gil-Gala","year":"2021","unstructured":"Gil-Gala, F.J., Menc\u00eda, C., Sierra, M.R., Varela, R.: Learning ensembles of priority rules for on-line scheduling by hybrid evolutionary algorithm. Integr. Comput. Aided Eng. 28(1), 65\u201380 (2021)","journal-title":"Integr. Comput. Aided Eng."},{"doi-asserted-by":"publisher","unstructured":"Gil-Gala, F.J., Sierra, M.R., Menc\u00eda, C., Varela, R.: Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling. Nat. Comput., 1\u201311 (2020). https:\/\/doi.org\/10.1007\/s11047-020-09793-4","key":"13_CR10","DOI":"10.1007\/s11047-020-09793-4"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"100944","DOI":"10.1016\/j.swevo.2021.100944","volume":"66","author":"FJ Gil-Gala","year":"2021","unstructured":"Gil-Gala, F.J., Sierra, M.R., Menc\u00eda, C., Varela, R.: Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity. Swarm Evol. Comput. 66, 100944 (2021). https:\/\/doi.org\/10.1016\/j.swevo.2021.100944","journal-title":"Swarm Evol. Comput."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-19651-6_22","volume-title":"From Bioinspired Systems and Biomedical Applications to Machine Learning","author":"FJ Gil-Gala","year":"2019","unstructured":"Gil-Gala, F.J., Varela, R.: Genetic algorithm to evolve ensembles of rules for on-line scheduling on single machine with variable capacity. In: Ferr\u00e1ndez Vicente, J.M., \u00c1lvarez-S\u00e1nchez, J.R., de la Paz L\u00f3pez, F., Toledo Moreo, J., Adeli, H. (eds.) IWINAC 2019. LNCS, vol. 11487, pp. 223\u2013233. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19651-6_22"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"Hart, E., Sim, K.: A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609\u2013635 (2016)","journal-title":"Evol. Comput."},{"unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)","key":"13_CR14"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-16711-0_7","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"P McMenemy","year":"2019","unstructured":"McMenemy, P., Veerapen, N., Adair, J., Ochoa, G.: Rigorous performance analysis of state-of-the-art TSP heuristic solvers. In: Liefooghe, A., Paquete, L. (eds.) EvoCOP 2019. LNCS, vol. 11452, pp. 99\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16711-0_7"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1162\/evco_a_00230","volume":"27","author":"S Nguyen","year":"2019","unstructured":"Nguyen, S., Mei, Y., Xue, B., Zhang, M.: A hybrid genetic programming algorithm for automated design of dispatching rules. Evol. Comput. 27(3), 467\u2013496 (2019)","journal-title":"Evol. Comput."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-30668-1_8","volume-title":"Genetic Programming","author":"J Park","year":"2016","unstructured":"Park, J., Mei, Y., Nguyen, S., Chen, G., Johnston, M., Zhang, M.: Genetic programming based hyper-heuristics for dynamic job shop scheduling: cooperative coevolutionary approaches. In: Heywood, M.I., McDermott, J., Castelli, M., Costa, E., Sim, K. (eds.) EuroGP 2016. LNCS, vol. 9594, pp. 115\u2013132. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30668-1_8"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.asoc.2017.11.020","volume":"63","author":"J Park","year":"2018","unstructured":"Park, J., Mei, Y., Nguyen, S., Chen, G., Zhang, M.: An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling. Appl. Soft Comput. 63, 72\u201386 (2018)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06527-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T07:03:53Z","timestamp":1657004633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06527-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031065262","9783031065279"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06527-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWINAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Work-Conference on the Interplay Between Natural and Artificial Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto de la Cruz, Tenerife","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","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":"iwinac2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwinac.org\/iwinac2022\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfMaster","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"203","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":"121","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":"60% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}