The bin covering with delivery problem, extended investigations for the online case
Research output: Contribution to journal › Article › Research › peer-review
Standard
In: Central European Journal of Operations Research, Vol. 31.2023, No. March, 30.04.2022, p. 21-47.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - The bin covering with delivery problem, extended investigations for the online case
AU - Abraham, Gyula
AU - Auer, Peter
AU - Dosa, Gyorgy
AU - Dulai, Tibor
AU - Tuza, Zsolt
AU - Werner-Stark, Ágnes
N1 - Publisher Copyright: © 2022, The Author(s).
PY - 2022/4/30
Y1 - 2022/4/30
N2 - 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.
AB - 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.
KW - Bin covering
KW - Bin packing
KW - Metaheuristics
UR - http://www.scopus.com/inward/record.url?scp=85129178012&partnerID=8YFLogxK
U2 - 10.1007/s10100-022-00798-1
DO - 10.1007/s10100-022-00798-1
M3 - Article
AN - SCOPUS:85129178012
VL - 31.2023
SP - 21
EP - 47
JO - Central European Journal of Operations Research
JF - Central European Journal of Operations Research
SN - 1435-246X
IS - March
ER -
