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!
Description
Summary: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.
ISSN:1435-246X
1613-9178
DOI:10.1007/s10100-022-00798-1