Bin-Completion Algorithms for Multicontainer Packing and Covering Problems
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 117-123.
Abstract
Bin-completion, a bin-oriented branch-and-bound approach, was recently shown to be promising for the bin packing problem. We propose several improvements to bin-completion that significantly improves search efficiency. We also show the generality of bin-completion for packing and covering problems involving multiple containers, and present bin-completion algorithms for the multiple knapsack, bin covering, and min-cost covering (liquid loading) problems that significantly outperform the previous state of the art. However, we show that for the bin packing problem, bin-completion is not competitive with the state of the art solver.
@inproceedings{ijcai2005p103,
title = {Bin-Completion Algorithms for Multicontainer Packing and Covering Problems},
author = {Fukunaga, Alex S. and Korf, Richard E.},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {117--123},
year = {2005},
url = {https://ijcai.org/proceedings/2005/103},
}
TY - CPAPER TI - Bin-Completion Algorithms for Multicontainer Packing and Covering Problems AU - Fukunaga, Alex S. AU - Korf, Richard E. T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 117 EP - 123 UR - https://ijcai.org/proceedings/2005/103 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
