research-article

Monte carlo tree search on perfect rectangle packing problem instances

Authors:

Daan van den BergAuthors Info & Claims

GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion

Pages 1697 - 1703

https://doi.org/10.1145/3377929.3398115

Published: 08 July 2020 Publication History

Abstract

We explore the possibilities of Monte Carlo tree search (MCTS), immensely successful in games such as Go and Chess, to solve the perfect rectangle packing problem. Experiments are done on two differently generated problem sets of 1,000 instances each, and we explore six different rollout numbers and two different action-selection strategies for MCTS. We compare the algorithm's performance to an exact depth-first algorithm equipped with efficient pruning techniques. By rating the number of solutions found against the total number of tiles placed, we define a 'computationally economic tradeoff'. Different rollout numbers and strategies lead to different results, both within and between the two problem sets. We discuss these results in context of other heuristic algorithms on this problem and closely related areas.

References

[1]

Louis Victor Allis et al. 1994. Searching for solutions in games and artificial intelligence. Ponsen & Looijen Wageningen.

[2]

Ramón Alvarez-Valdés, Francisco Parreño, and José Manuel Tamarit. 2007. A tabu search algorithm for a two-dimensional non-guillotine cutting problem. European Journal of Operational Research 183, 3 (2007), 1167--1182.

[3]

Satomi Baba, Yongjoon Joe, Atsushi Iwasaki, and Makoto Yokoo. 2011. Real-Time Solving of Quantified CSPs Based on Monte-Carlo Game Tree Search. IJCAI International Joint Conference on Artificial Intelligence (07 2011), 655--661.

[4]

Steven Borowiec. 2016. AlphaGo seals 4-1 victory over Go grandmaster Lee Sedol. The Guardian 15 (2016).

[5]

C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton. 2012. A Survey of Monte Carlo Tree Search Methods. IEEE Transactions on Computational Intelligence and AI in Games 4, 1 (March 2012), 1--43.

[6]

Tristan Cazenave. 2009. Monte-carlo kakuro. In Advances in Computer Games. Springer, 45--54.

[7]

Tristan Cazenave. 2009. Nested monte-carlo search. In Twenty-First International Joint Conference on Artificial Intelligence.

[8]

Bernard Chazelle. 1983. The bottomn-left bin-packing heuristic: An efficient implementation. IEEE Trans. Comput. 8 (1983), 697--707.

Digital Library

[9]

Kathryn A Dowsland. 1993. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68, 3 (1993), 389--399.

[10]

Lu Duan, Haoyuan Hu, Yu Qian, Yu Gong, Xiaodong Zhang, Jiangwen Wei, and Yinghui Xu. 2019. A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 1386--1394.

[11]

Stefan Edelkamp, Max Gath, and Moritz Rohde. 2014. Monte-Carlo Tree Search for 3D Packing with Object Orientation. In KI 2014: Advances in Artificial Intelligence, Carsten Lutz and Michael Thielscher (Eds.). Springer International Publishing, Cham, 285--296.

[12]

Thomas Fischer, Thomas Stützle, Holger Hoos, and Peter Merz. 2005. An analysis of the hardness of TSP instances for two high performance algorithms. In Proceedings of the Sixth Metaheuristics International Conference. 361--367.

[13]

Julia Funke, Stefan Hougardy, and Jan Schneider. 2016. An exact algorithm for wirelength optimal placements in VLSI design. Integration 52 (2016), 355--366.

Digital Library

[14]

Michael R Garey and David S Johnson. 1979. Computers and intractability. Vol. 174. freeman San Francisco.

[15]

Fréjus AR Gbaguidi, Selma Boumerdassi, and Eugène C Ezin. 2017. Adapted Bin Packing Algorithm For Virtuals Machines Placement Into Datacenters. Computer Science & Information Technology (2017), 69.

[16]

Carla Gomes and Bart Selman. 1999. On the fine structure of large search spaces. In Proceedings 11th International Conference on Tools with Artificial Intelligence. IEEE, 197--201.

Digital Library

[17]

Xiaoxiao Guo, Satinder Singh, Honglak Lee, Richard L Lewis, and Xiaoshi Wang. 2014. Deep learning for real-time Atari game play using offline Monte-Carlo tree search planning. In Advances in neural information processing systems. 3338--3346.

[18]

Stefan Hougardy. 2012. A scale invariant algorithm for packing rectangles perfectly. In Proceedings of the fourth International Workshop on Bin Packing and Placement Constraints, Nantes, France.

[19]

Stefan Hougardy. 2012. A scale invariant exact algorithm for dense rectangle packing problems. Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universität Bonn.

[20]

E. Huang and R. E. Korf. 2013. Optimal Rectangle Packing: An Absolute Placement Approach. Journal of Artificial Intelligence Research 46 (Jan 2013), 47--87.

[21]

Jiayi Huang, Md. Mostofa Ali Patwary, and Gregory F. Diamos. 2019. Coloring Big Graphs with AlphaGoZero. CoRR abs/1902.10162 (2019). arXiv:1902.10162 http://arxiv.org/abs/1902.10162

[22]

Stefan Jakobs. 1996. On genetic algorithms for the packing of polygons. European journal of operational research 88, 1 (1996), 165--181.

[23]

Claire Kenyon and Eric Rémila. 2000. A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25, 4 (2000), 645--656.

Digital Library

[24]

Richard E. Korf. 2003. Optimal Rectangle Packing: Initial Results. In Proceedings of the Thirteenth International Conference on International Conference on Automated Planning and Scheduling (ICAPS'03). AAAI Press, 287--295.

[25]

Richard E Korf. 2004. Optimal Rectangle Packing: New Results. In ICAPS. 142--149.

[26]

N. Lesh, J. Marks, A. McMahon, and M. Mitzenmacher. 2004. Exhaustive approaches to 2D rectangular perfect packings. Inform. Process. Lett. 90, 1 (2004), 7 -- 14.

Digital Library

[27]

Hailiang Li, Yan Wang, DanPeng Ma, Yang Fang, and Zhibin Lei. 2018. Quasi-Monte-Carlo Tree Search for 3D Bin Packing. In Pattern Recognition and Computer Vision, Jian-Huang Lai, Cheng-Lin Liu, Xilin Chen, Jie Zhou, Tieniu Tan, Nanning Zheng, and Hongbin Zha (Eds.). Springer International Publishing, Cham, 384--396.

[28]

Dequan Liu and Hongfei Teng. 1999. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research 112, 2 (1999), 413--420.

[29]

Igor Pejic. 2020. Intances from the G-set and the B-set used for solving PRPP. https://github.com/igorpejic/visapi/tree/master/problems. (2020).

[30]

Maarten P. D. Schadd, Mark H. M. Winands, H. Jaap Van Den Herik, and Huib Aldewereld. 2008. Addressing NP-complete puzzles with Monte-Carlo methods. In In proceedings of the AISB 2008 symposium on logic and the simulation of interaction and reasoning, volume 9.

[31]

Yuji Shigehiro, Seiji Koshiyama, and Tatsuya Masuda. 2001. Stochastic tabu search for rectangle packing. In 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat. No. 01CH37236), Vol. 4. IEEE, 2753--2758.

[32]

David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al. 2016. Mastering the game of Go with deep neural networks and tree search. nature 529, 7587 (2016), 484.

[33]

David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, et al. 2017. Mastering the game of go without human knowledge. Nature 550, 7676 (2017), 354--359.

[34]

Daan van den Berg, Florian Braam, Mark Moes, Emiel Suilen, and Sandjai Bhulai. 2016. Almost Squares in Almost Squares: Solving the Final Instance. DATA ANALYTICS 2016 (2016), 81.

[35]

Gijs van Horn, Richard Olij, Joeri Sleegers, and Daan van den Berg. 2018. A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances. DATA ANALYTICS 2018 (2018), 101.

[36]

Basil Vandegriend and Joseph Culberson. 1998. The G(n,m) phase transition is not hard for the Hamiltonian Cycle problem. Journal of Artificial Intelligence Research 9 (1998), 219--245.

Digital Library

[37]

Weixiong Zhang and Richard E Korf. 1996. A study of complexity transitions on the asymmetric traveling salesman problem. Artificial Intelligence 81, 1-2 (1996), 223--239.

Cited By

Galán López YGonzález García CGarcía Díaz VNúñez Valdez EGómez Gómez A(2024)Interpretability of rectangle packing solutions with Monte Carlo tree searchJournal of Heuristics10.1007/s10732-024-09525-230:3-4(173-198)Online publication date: 18-Mar-2024
https://doi.org/10.1007/s10732-024-09525-2
Braam Fvan den Berg D(2022)Which rectangle sets have perfect packings?Operations Research Perspectives10.1016/j.orp.2021.1002119(100211)Online publication date: 2022
https://doi.org/10.1016/j.orp.2021.100211

Index Terms

Monte carlo tree search on perfect rectangle packing problem instances
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Game tree search
      2. Heuristic function construction
2. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Permutations and combinations

Recommendations

LinUCB applied to Monte Carlo tree search

UCT is a standard method of Monte Carlo tree search (MCTS) algorithms, which have been applied to various domains and have achieved remarkable success. This study proposes a family of LinUCT algorithms that incorporate LinUCB into MCTS algorithms. ...
Parallel Monte Carlo Search for Imperfect Information Game Daihinmin
PAAP '12: Proceedings of the 2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming

Computer games, such as chess, have recently become an important research topic in the field of computation intelligence. Monto Carlo massive searching is very successful in the game of GO as it has a huge intractable search space and no good partial ...
Monte Carlo Tree Search with Metaheuristics
Artificial Intelligence and Soft Computing
Abstract
Monte Carlo Tree Search/Upper Confidence bounds applied to Trees (MCTS/UCT) is a popular and powerful search technique applicable to many domains, most frequently to searching game trees. Even though the algorithm has been widely researched, there ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion

July 2020

1982 pages

ISBN:9781450371278

DOI:10.1145/3377929

General Chair:
Carlos Artemio Coello Coello
CINVESTAV-IPN

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '20

Sponsor:

SIGEVO

GECCO '20: Genetic and Evolutionary Computation Conference

July 8 - 12, 2020

Cancún, Mexico

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
241
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)6

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Galán López YGonzález García CGarcía Díaz VNúñez Valdez EGómez Gómez A(2024)Interpretability of rectangle packing solutions with Monte Carlo tree searchJournal of Heuristics10.1007/s10732-024-09525-230:3-4(173-198)Online publication date: 18-Mar-2024
https://doi.org/10.1007/s10732-024-09525-2
Braam Fvan den Berg D(2022)Which rectangle sets have perfect packings?Operations Research Perspectives10.1016/j.orp.2021.1002119(100211)Online publication date: 2022
https://doi.org/10.1016/j.orp.2021.100211

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten