{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:17:49Z","timestamp":1774282669479,"version":"3.50.1"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031838873","type":"print"},{"value":"9783031838859","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-83885-9_6","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:34:43Z","timestamp":1745397283000},"page":"61-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using the\u00a0Pilot Method as\u00a0a\u00a0Problem-Independent Metaheuristic for\u00a0Multi-objective Beam Search"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Bindreiter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7830-3138","authenticated-orcid":false,"given":"Bernhard","family":"Werth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0323-9274","authenticated-orcid":false,"given":"Stefan","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.cor.2013.09.003","volume":"43","author":"I Araya","year":"2014","unstructured":"Araya, I., Riff, M.C.: A beam search approach to the container loading problem. Comput. Oper. Res. 43, 100\u2013107 (2014)","journal-title":"Comput. Oper. Res."},{"key":"6_CR2","unstructured":"Barthelemy, T., Parragh, S.N., Tricoire, F., Hartl, R.F.: Beam search for integer multi-objective optimization (2015)"},{"key":"6_CR3","first-page":"56","volume-title":"Encyclopedia of Artificial Intelligence","author":"R Bisiani","year":"1987","unstructured":"Bisiani, R.: Encyclopedia of Artificial Intelligence, pp. 56\u201358. Wiley & Sons, Hoboken (1987)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/TCIAIG.2011.2180723","volume":"4","author":"T Cazenave","year":"2012","unstructured":"Cazenave, T.: Monte Carlo beam search. IEEE Trans. Comput. Intell. AI Games 4(1), 68\u201372 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"6_CR5","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, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Honda, N.: Backtrack beam search for multiobjective scheduling problem. In: Tanio, T., Tanaka, T., Inuiguchi, M. (eds.) Multi-Objective Programming and Goal Programming. Advances in Soft Computing, vol. 21, pp. 147\u2013152. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-36510-5_19","DOI":"10.1007\/978-3-540-36510-5_19"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26(1), 35\u201362 (1988)","journal-title":"Int. J. Prod. Res."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Pryzant, R., Iter, D., Li, J., Lee, Y.T., Zhu, C., Zeng, M.: Automatic prompt optimization with \u201cgradient descent\" and beam search (2023)","DOI":"10.18653\/v1\/2023.emnlp-main.494"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu, I., Bayiz, M.: Job shop scheduling with beam search. Eur. J. Oper. Res. 118(2), 390\u2013412 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Voss","year":"2005","unstructured":"Voss, S., Duin, C., Fink, A.: Looking ahead with the pilot method. Ann. Oper. Res. 136, 225\u2013242 (2005)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83885-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:34:48Z","timestamp":1745397288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83885-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031838873","9783031838859"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83885-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCAST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Systems Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Las Palmas de Canaria","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19th","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocast2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocast2024.fulp.ulpgc.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}