Abstract
Despite the existence of efficient solution methods for bin packing problems, in practice these seldom occur in such a pure form but feature instead various considerations such as pairwise conflicts or profits between items, or aiming for balanced loads amongst the bins. The Wedding Seating Problem is a combinatorial optimization problem incorporating elements of bin packing with conflicts, bin packing with profits, and load balancing. We use this representative problem to present and compare constraint programming, integer programming, and metaheuristic approaches.
Cite
CITATION STYLE
Olivier, P., Lodi, A., & Pesant, G. (2018). A comparison of optimization methods for multi-objective constrained bin packing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10848 LNCS, pp. 462–476). Springer Verlag. https://doi.org/10.1007/978-3-319-93031-2_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
