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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lewis, R.: Constructing wedding seating plans: a tabu subject. In: CSREA Press, pp. 24–32 (2013)
Miettinen, K.: Nonlinear Multiobjective Optimization. Springer, Heidelberg (1998). https://doi.org/10.1007/978-1-4615-5563-6
Lewis, R., Carroll, F.: Creating seating plans: a practical application. J. Oper. Res. Soc. 67(11), 1353–1362 (2016)
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
Schaus, P.: Solving balancing and bin-packing problems with constraint programming. Ph.D thesis, Université catholique de Louvain (2009)
Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J. Comput. 25(2), 244–255 (2013)
Wang, Z., Han, X., Dósa, G., Tuza, Z.: Bin packing game with an interest matrix. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 57–69. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21398-9_5
Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30201-8_47
Pesant, G.: Achieving domain consistency and counting solutions for dispersion constraints. INFORMS J. Comput. 27(4), 690–703 (2015)
Gualandi, S., Lombardi, M.: A simple and effective decomposition for the multidimensional binpacking constraint. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 356–364. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40627-0_29
Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49481-2_30
Mitsos, A., Chachuat, B., Barton, P.I.: Mccormick-based relaxations of algorithms. SIAM J. Optim. 20(2), 573–601 (2009)
Boland, N., Charkhgard, H., Savelsbergh, M.: A criterion space search algorithm for biobjective integer programming: the balanced box method. INFORMS J. Comput. 27(4), 735–754 (2015)
Acknowledgements
Financial support for this research was provided by NSERC Discovery Grant 218028/2017 and CERC, École Polytechnique de Montréal.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Olivier, P., Lodi, A., Pesant, G. (2018). A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems. In: van Hoeve, WJ. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2018. Lecture Notes in Computer Science(), vol 10848. Springer, Cham. https://doi.org/10.1007/978-3-319-93031-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-93031-2_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93030-5
Online ISBN: 978-3-319-93031-2
eBook Packages: Computer ScienceComputer Science (R0)