{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:42:18Z","timestamp":1740145338358,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T00:00:00Z","timestamp":1651276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T00:00:00Z","timestamp":1651276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["SNN 129364","2019-2.1.11-T\u00c9T-2020-00113"],"award-info":[{"award-number":["SNN 129364","2019-2.1.11-T\u00c9T-2020-00113"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We deal with a model that is called Bin Covering with Delivery. Here we search for a <jats:italic>\u201cgood and fast\u201d<\/jats:italic> covering. This problem has been defined and investigated recently. Here we continue and significantly augment the preliminary investigations of the problem. After studying the goodness of adapted versions of some classical algorithms, we propose a parametrized algorithm and use a heuristic parameter optimization method to solve this (algorithmically very challenging) problem. Namely, we apply local search to determine a good choice of the parameters. The efficiency of the proposed method is demonstrated by intensive computer experiments on appropriate modifications of benchmark instances.\n<\/jats:p>","DOI":"10.1007\/s10100-022-00798-1","type":"journal-article","created":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T08:03:30Z","timestamp":1651305810000},"page":"21-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The bin covering with delivery problem, extended investigations for the online case"],"prefix":"10.1007","volume":"31","author":[{"given":"Gyula","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Auer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyorgy","family":"Dosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9609-1538","authenticated-orcid":false,"given":"Tibor","family":"Dulai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnes","family":"Werner-Stark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,30]]},"reference":[{"key":"798_CR1","unstructured":"Abraham Gy (2021) Large Range benchmark class in the are of bin packing. https:\/\/1drv.ms\/u\/s!AvPxqf0yoEWEz5YVK8hAHVBhwVik2Q?e=n4HFet"},{"key":"798_CR2","doi-asserted-by":"crossref","unstructured":"\u00c1brah\u00e1m G, D\u00f3sa G, Dulai T, Tuza Zs, \u00c1 (2021) Werner-Stark, Efficient pre-solve algorithms for the Schwerin and Falkenauer_U bin packing benchmark problems for getting optimal solutions with high probability, mathematics, in press","DOI":"10.3390\/math9131540"},{"issue":"1","key":"798_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2012.10.006","volume":"41","author":"L Ahlroth","year":"2013","unstructured":"Ahlroth L, Schumacher A, Orponen P (2013) Online bin packing with delay and holding costs. Oper Res Lett 41(1):1\u20136","journal-title":"Oper Res Lett"},{"key":"798_CR4","doi-asserted-by":"crossref","unstructured":"Benk\u0151 A, D\u00f3sa G, Tuza Zs (2010) Bin Packing\/Covering with Delivery, solved with the evolution of algorithms, In: IEEE Fifth international conference on bio-inspired computing: theories and applications (BIC-TA), pp. 298\u2013302","DOI":"10.1109\/BICTA.2010.5645312"},{"issue":"4","key":"798_CR5","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10100-012-0269-0","volume":"21","author":"A Benk\u0151","year":"2013","unstructured":"Benk\u0151 A, D\u00f3sa G, Zs T (2013) Bin covering with a general profit function: approximability results. Central Eur J Oper Res 21(4):805\u2013816","journal-title":"Central Eur J Oper Res"},{"key":"798_CR6","unstructured":"Bin Packing Benchmarks of Homepage Unibo, http:\/\/or.dei.unibo.it\/library\/bpplib"},{"key":"798_CR7","doi-asserted-by":"publisher","unstructured":"Coffman EG, Garey MR, Johnson DS (1984) Approximation algorithms for bin-packing \u2014 an updated survey. In: Ausiello G., Lucertini M., Serafini P. (eds) Algorithm design for computer system design. International Centre for Mechanical Sciences (Courses and Lectures), vol 284. Springer, Vienna. https:\/\/doi.org\/10.1007\/978-3-7091-4338-4_3","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"798_CR8","doi-asserted-by":"crossref","unstructured":"Csirik J, Woeginger GJ (1998) On-line packing and covering problems, In: A. Fiat, G.J. Woeginger(eds). Online Algorithms. LNCS. Vol 1443, Springer, pp. 147\u2013177","DOI":"10.1007\/BFb0029568"},{"key":"798_CR9","unstructured":"D\u00f3sa G, Tuza Zs (2012) Bin Packing\/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms, arXiv:1207.5672"},{"key":"798_CR10","doi-asserted-by":"publisher","first-page":"100647","DOI":"10.1016\/j.disopt.2021.100647","volume":"41","author":"L Epstein","year":"2021","unstructured":"Epstein L (2021) On bin packing with clustering and bin packing with delays. Discret Optim 41:100647","journal-title":"Discret Optim"},{"issue":"1","key":"798_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heurist 2(1):5\u201330","journal-title":"J Heurist"},{"key":"798_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01415672","volume":"42","author":"G Galambos","year":"1995","unstructured":"Galambos G, Woeginger GJ (1995) On-line bin packing \u2013 a restricted survey. ZOR - Method Model Oper Res 42:25\u201345. https:\/\/doi.org\/10.1007\/BF01415672","journal-title":"ZOR - Method Model Oper Res"},{"key":"798_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York"},{"key":"798_CR14","doi-asserted-by":"crossref","unstructured":"van Laarhoven PJM, Aarts EHL (1987) Simulated annealing: theory and applications. Kluwer Academic PublisHers, Mathematics and its Applications","DOI":"10.1007\/978-94-015-7744-1"},{"key":"798_CR15","unstructured":"Miettinen K, Makela MM, Neittannmaki P, P\u00e9riaux J (Eds.) (1999) Evolutionary algorithms in engineering and computer science, Wiley"},{"key":"798_CR16","doi-asserted-by":"crossref","unstructured":"Schwerin P, W\u00e4scher G (1997) The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. Int Trans Oper Res 4(5 -6):377\u2013389","DOI":"10.1111\/j.1475-3995.1997.tb00093.x"},{"key":"798_CR17","doi-asserted-by":"crossref","unstructured":"Woeginger G, Improved Space for Bounded-Space, On-Line Bin-Packing, SIAM J. Discrete Math., 6(4), 575\u2013581","DOI":"10.1137\/0406045"},{"key":"798_CR18","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.ejor.2006.09.059","volume":"182","author":"W Zhong","year":"2007","unstructured":"Zhong W, Dosa G, Tan Z (2007) On the machine scheduling problem with job delivery coordination. Eur J Oper Res 182:1057\u20131072","journal-title":"Eur J Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-022-00798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-022-00798-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-022-00798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T10:16:06Z","timestamp":1674296166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-022-00798-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,30]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["798"],"URL":"https:\/\/doi.org\/10.1007\/s10100-022-00798-1","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2022,4,30]]},"assertion":[{"value":"24 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}