Abstract
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance, which are instances of the symmetry detection by dominance detection approach for pruning symmetric nodes in the MKP branch-and-bound search space. In addition, we integrate the “bound-and-bound” upper bound validation technique used in MKP solvers from the OR literature. We show experimentally that our new MKP solver, which integrates symmetry techniques from constraint programming and bound-and-bound techniques from operations research, significantly outperforms previous solvers on hard instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eilon, S., Christofides, N.: The loading problem. Management Science 17(5), 259–268 (1971)
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Proceedings of the International Conference on Constraint Programming, pp. 93–107 (2001)
Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Proceedings of the International Conference on Constraint Programming, pp. 77–92 (2001)
Focacci, F., Shaw, P.: Pruning sub-optimal search branches using local search. In: Proc. CPAIOR, pp. 181–189 (2002)
Fukunaga, A.: Exploiting symmetry in multiple knapsack problems. In: Proc. Seventh International Workshop on symmetry and constraint satisfaction problems, pp. 39–46 (2007)
Fukunaga, A., Korf, R.: Bin-completion algorithms for multicontainer packing, knapsack, and covering problems. Journal of Artificial Intelligence Research 28, 393–429 (2007)
Kalagnanam, J.R., Davenport, A.J., Lee, H.S.: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research 1, 221–238 (2001)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
Labbé, M., Laporte, G., Martello, S.: Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research 149, 490–498 (2003)
Martello, S., Toth, P.: A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics 3, 275–288 (1981)
Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Chichester (1990)
Pisinger, D.: An exact algorithm for large multiple knapsack problems. European Journal of Operational Research 114, 528–541 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fukunaga, A.S. (2008). Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver. In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-68155-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68154-0
Online ISBN: 978-3-540-68155-7
eBook Packages: Computer ScienceComputer Science (R0)