A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems
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.
Financial support for this research was provided by NSERC Discovery Grant 218028/2017 and CERC, École Polytechnique de Montréal.
- 1.Lewis, R.: Constructing wedding seating plans: a tabu subject. In: CSREA Press, pp. 24–32 (2013)Google Scholar
- 4.Bellows, M.L., Peterson, J.D.L.: Finding an optimal seating chart for a wedding. https://www.improbable.com/2012/02/12/finding-an-optimal-seating-chart-for-a-wedding. Accessed 23 May 2018
- 5.Schaus, P.: Solving balancing and bin-packing problems with constraint programming. Ph.D thesis, Université catholique de Louvain (2009)Google Scholar