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.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 21-47 |
| Seitenumfang | 27 |
| Fachzeitschrift | Central European Journal of Operations Research |
| Jahrgang | 31.2023 |
| Ausgabenummer | March |
| DOIs | |
| Publikationsstatus | Elektronische Veröffentlichung vor Drucklegung. - 30 Apr. 2022 |
Bibliographische Notiz
Funding Information:The authors would like to thank the useful ideas and comments of two anonoumos referees, that helped to improve the presentation significantly. Research of Gyorgy Dosa and Zsolt Tuza is supported in part by the National Research, Development and Innovation Office – NKFIH under the grant SNN 129364. The authors also acknowledge the financial support also from the Slovenian – Hungarian bilateral project, “Optimization and fault forecasting in port logistics processes using artificial intelligence, process mining and operations research”, grant 2019-2.1.11-TÉT-2020-00113.
Publisher Copyright:
© 2022, The Author(s).