An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Search. Pages 1402-1410.
Abstract
This paper describes a constrained bin-packing problem (CBPP ) and an approximate, anytime algorithm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality . The algorithm for CBPP uses a heuristic search for labeling edges with a binary value, together with a beam search and constraint propagation. Some experimental results are provided. This algorithm has been successfully applied to industrial-scale scheduling problems.
@inproceedings{ijcai1997p202,
title = {An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem},
author = {Lee, Ho Soo and Trumbo, Mark},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {1402--1410},
year = {1997},
note = {Search},
url = {https://ijcai.org/proceedings/1997/202},
}
TY - CPAPER TI - An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem AU - Lee, Ho Soo AU - Trumbo, Mark T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 1402 EP - 1410 UR - https://ijcai.org/proceedings/1997/202 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
