The bin covering with delivery problem, extended investigations for the online case

We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” 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 ver...

Full description

Saved in:
Bibliographic Details
Published in:Central European journal of operations research 2023-03, Vol.31 (1), p.21-47
Main Authors: Abraham, Gyula, Auer, Peter, Dosa, Gyorgy, Dulai, Tibor, Tuza, Zsolt, Werner-Stark, Agnes
Format: Article
Language:English
Subjects:
Algorithms
Business and Management
Delivery of goods
Efficiency
Mathematical optimization
Operations research
Operations Research/Decision Theory
Optimization
Original Paper
Parameters
Scheduling (Management)
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c410t-1098e912dab5069f6863952647adf31c5056d81ccedce97c338744d574a11f443
container_end_page 47
container_issue 1
container_start_page 21
container_title Central European journal of operations research
container_volume 31
creator Abraham, Gyula
Auer, Peter
Dosa, Gyorgy
Dulai, Tibor
Tuza, Zsolt
Werner-Stark, Agnes
description We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” 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.
doi_str_mv 10.1007/s10100-022-00798-1
format article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2767522086</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A734180405</galeid><sourcerecordid>A734180405</sourcerecordid><originalsourceid>FETCH-LOGICAL-c410t-1098e912dab5069f6863952647adf31c5056d81ccedce97c338744d574a11f443</originalsourceid><addsrcrecordid>eNp9UcFOHSEUJU1Nap_-QFck3TqWCwzMLI1Ra2LShZq4Izy4Mw8zD15hnq1_X-yYWDcNCfdecs7hwCHkC7BTYEx_K8BqbRjnTR37roEP5BAUiKYH3X2svRRtw6V6-EQ-l_LIGIeeqUNye7dBug6RuvSEOcSR_grzhnqcQp2f6S6n9YTbE4q_Z4wePQ3xCcscRjuHFAsdUqZz1UhxChGpswWPyMFgp4LHr3VF7i8v7s6_Nzc_rq7Pz24aJ4HNDbC-wx64t-uWqX5QnRJ9y5XU1g8CXMta5TtwDr3DXjshOi2lb7W0AIOUYkW-LrrV5M99NWUe0z7HeqXhWumWc1YlV-R0QY12QhPikOZsXV0et8GliEOo52daSOiYZG0lnPxDWO9LfVepWwnjZi6j3ZfyHs4XuMuplIyD2eWwtfnZADMv4ZglHFPDMX_DMVBJYiGV3cunY36z_h_WHzXpkKo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2767522086</pqid></control><display><type>article</type><title>The bin covering with delivery problem, extended investigations for the online case</title><source>Business Source Ultimate【Trial: -2024/12/31】【Remote access available】</source><source>ABI/INFORM Global</source><source>Springer Link</source><creator>Abraham, Gyula ; Auer, Peter ; Dosa, Gyorgy ; Dulai, Tibor ; Tuza, Zsolt ; Werner-Stark, Agnes</creator><creatorcontrib>Abraham, Gyula ; Auer, Peter ; Dosa, Gyorgy ; Dulai, Tibor ; Tuza, Zsolt ; Werner-Stark, Agnes</creatorcontrib><description>We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” 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.</description><identifier>ISSN: 1435-246X</identifier><identifier>EISSN: 1613-9178</identifier><identifier>DOI: 10.1007/s10100-022-00798-1</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Business and Management ; Delivery of goods ; Efficiency ; Mathematical optimization ; Operations research ; Operations Research/Decision Theory ; Optimization ; Original Paper ; Parameters ; Scheduling (Management)</subject><ispartof>Central European journal of operations research, 2023-03, Vol.31 (1), p.21-47</ispartof><rights>The Author(s) 2022</rights><rights>COPYRIGHT 2023 Springer</rights><rights>The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c410t-1098e912dab5069f6863952647adf31c5056d81ccedce97c338744d574a11f443</cites><orcidid>0000-0002-9609-1538</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2767522086/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2767522086?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11687,27923,27924,36059,44362,74666</link.rule.ids></links><search><creatorcontrib>Abraham, Gyula</creatorcontrib><creatorcontrib>Auer, Peter</creatorcontrib><creatorcontrib>Dosa, Gyorgy</creatorcontrib><creatorcontrib>Dulai, Tibor</creatorcontrib><creatorcontrib>Tuza, Zsolt</creatorcontrib><creatorcontrib>Werner-Stark, Agnes</creatorcontrib><title>The bin covering with delivery problem, extended investigations for the online case</title><title>Central European journal of operations research</title><addtitle>Cent Eur J Oper Res</addtitle><description>We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” 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.</description><subject>Algorithms</subject><subject>Business and Management</subject><subject>Delivery of goods</subject><subject>Efficiency</subject><subject>Mathematical optimization</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Original Paper</subject><subject>Parameters</subject><subject>Scheduling (Management)</subject><issn>1435-246X</issn><issn>1613-9178</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp9UcFOHSEUJU1Nap_-QFck3TqWCwzMLI1Ra2LShZq4Izy4Mw8zD15hnq1_X-yYWDcNCfdecs7hwCHkC7BTYEx_K8BqbRjnTR37roEP5BAUiKYH3X2svRRtw6V6-EQ-l_LIGIeeqUNye7dBug6RuvSEOcSR_grzhnqcQp2f6S6n9YTbE4q_Z4wePQ3xCcscRjuHFAsdUqZz1UhxChGpswWPyMFgp4LHr3VF7i8v7s6_Nzc_rq7Pz24aJ4HNDbC-wx64t-uWqX5QnRJ9y5XU1g8CXMta5TtwDr3DXjshOi2lb7W0AIOUYkW-LrrV5M99NWUe0z7HeqXhWumWc1YlV-R0QY12QhPikOZsXV0et8GliEOo52daSOiYZG0lnPxDWO9LfVepWwnjZi6j3ZfyHs4XuMuplIyD2eWwtfnZADMv4ZglHFPDMX_DMVBJYiGV3cunY36z_h_WHzXpkKo</recordid><startdate>20230301</startdate><enddate>20230301</enddate><creator>Abraham, Gyula</creator><creator>Auer, Peter</creator><creator>Dosa, Gyorgy</creator><creator>Dulai, Tibor</creator><creator>Tuza, Zsolt</creator><creator>Werner-Stark, Agnes</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-9609-1538</orcidid></search><sort><creationdate>20230301</creationdate><title>The bin covering with delivery problem, extended investigations for the online case</title><author>Abraham, Gyula ; Auer, Peter ; Dosa, Gyorgy ; Dulai, Tibor ; Tuza, Zsolt ; Werner-Stark, Agnes</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c410t-1098e912dab5069f6863952647adf31c5056d81ccedce97c338744d574a11f443</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Business and Management</topic><topic>Delivery of goods</topic><topic>Efficiency</topic><topic>Mathematical optimization</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Original Paper</topic><topic>Parameters</topic><topic>Scheduling (Management)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Abraham, Gyula</creatorcontrib><creatorcontrib>Auer, Peter</creatorcontrib><creatorcontrib>Dosa, Gyorgy</creatorcontrib><creatorcontrib>Dulai, Tibor</creatorcontrib><creatorcontrib>Tuza, Zsolt</creatorcontrib><creatorcontrib>Werner-Stark, Agnes</creatorcontrib><collection>SpringerOpen</collection><collection>CrossRef</collection><collection>Gale Business Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI商业信息数据库</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Central European journal of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abraham, Gyula</au><au>Auer, Peter</au><au>Dosa, Gyorgy</au><au>Dulai, Tibor</au><au>Tuza, Zsolt</au><au>Werner-Stark, Agnes</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The bin covering with delivery problem, extended investigations for the online case</atitle><jtitle>Central European journal of operations research</jtitle><stitle>Cent Eur J Oper Res</stitle><date>2023-03-01</date><risdate>2023</risdate><volume>31</volume><issue>1</issue><spage>21</spage><epage>47</epage><pages>21-47</pages><issn>1435-246X</issn><eissn>1613-9178</eissn><abstract>We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” 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.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s10100-022-00798-1</doi><tpages>27</tpages><orcidid>https://orcid.org/0000-0002-9609-1538</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1435-246X
ispartof Central European journal of operations research, 2023-03, Vol.31 (1), p.21-47
issn 1435-246X
1613-9178
language eng
recordid cdi_proquest_journals_2767522086
source Business Source Ultimate【Trial: -2024/12/31】【Remote access available】; ABI/INFORM Global; Springer Link
subjects Algorithms
Business and Management
Delivery of goods
Efficiency
Mathematical optimization
Operations research
Operations Research/Decision Theory
Optimization
Original Paper
Parameters
Scheduling (Management)
title The bin covering with delivery problem, extended investigations for the online case
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T08%3A14%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20bin%20covering%20with%20delivery%20problem,%20extended%20investigations%20for%20the%20online%20case&rft.jtitle=Central%20European%20journal%20of%20operations%20research&rft.au=Abraham,%20Gyula&rft.date=2023-03-01&rft.volume=31&rft.issue=1&rft.spage=21&rft.epage=47&rft.pages=21-47&rft.issn=1435-246X&rft.eissn=1613-9178&rft_id=info:doi/10.1007/s10100-022-00798-1&rft_dat=%3Cgale_proqu%3EA734180405%3C/gale_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c410t-1098e912dab5069f6863952647adf31c5056d81ccedce97c338744d574a11f443%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2767522086&rft_id=info:pmid/&rft_galeid=A734180405&rfr_iscdi=true