Solving the Quadratic Assignment Problem using Deep Reinforcement Learning (2310.01604v1)
Abstract: The Quadratic Assignment Problem (QAP) is an NP-hard problem which has proven particularly challenging to solve: unlike other combinatorial problems like the traveling salesman problem (TSP), which can be solved to optimality for instances with hundreds or even thousands of locations using advanced integer programming techniques, no methods are known to exactly solve QAP instances of size greater than 30. Solving the QAP is nevertheless important because of its many critical applications, such as electronic wiring design and facility layout selection. We propose a method to solve the original Koopmans-Beckman formulation of the QAP using deep reinforcement learning. Our approach relies on a novel double pointer network, which alternates between selecting a location in which to place the next facility and a facility to place in the previous location. We train our model using A2C on a large dataset of synthetic instances, producing solutions with no instance-specific retraining necessary. Out of sample, our solutions are on average within 7.5% of a high-quality local search baseline, and even outperform it on 1.2% of instances.
- Solution of a min-max vehicle routing problem. INFORMS Journal on computing, 14(2):132–143, 2002.
- Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940, 2016.
- Combinatorial optimization and reasoning with graph neural networks. J. Mach. Learn. Res., 24:130–1, 2023.
- Nicos Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. 1976.
- Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555, 2014.
- Reinforcement learning with combinatorial actions: An application to vehicle routing. Advances in Neural Information Processing Systems, 33:609–620, 2020.
- Two classes of quadratic assignment problems that are solvable as linear assignment problems. Discrete Optimization, 8(3):446–451, 2011.
- Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, pp. 249–256. JMLR Workshop and Conference Proceedings, 2010.
- Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023. URL https://www.gurobi.com.
- Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475, 2018.
- Assignment problems and the location of economic activities. Econometrica: journal of the Econometric Society, pp. 53–76, 1957.
- A survey for the quadratic assignment problem. European journal of operational research, 176(2):657–690, 2007.
- Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602, 2013.
- Asynchronous methods for deep reinforcement learning. In International conference on machine learning, pp. 1928–1937. PMLR, 2016.
- Reinforcement learning for solving the vehicle routing problem. Advances in neural information processing systems, 31, 2018.
- Revised note on learning quadratic assignment with graph neural networks. In 2018 IEEE Data Science Workshop (DSW), pp. 1–5. IEEE, 2018.
- On the difficulty of generalizing reinforcement learning framework for combinatorial optimization. arXiv preprint arXiv:2108.03713, 2021.
- P-complete approximation problems. Journal of the ACM (JACM), 23(3):555–565, 1976.
- A general reinforcement learning algorithm that masters chess, shogi, and go through self-play. Science, 362(6419):1140–1144, 2018.
- Sequence to sequence learning with neural networks. In Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K.Q. Weinberger (eds.), Advances in Neural Information Processing Systems, volume 27. Curran Associates, Inc., 2014.
- Attention is all you need. Advances in neural information processing systems, 30, 2017.
- Pointer networks. Advances in neural information processing systems, 28, 2015.
- Learning combinatorial embedding networks for deep graph matching. In Proceedings of the IEEE/CVF international conference on computer vision, pp. 3056–3065, 2019.
- Graduated assignment for joint multi-graph matching and clustering with application to unsupervised graph matching network learning. Advances in Neural Information Processing Systems, 33:19908–19919, 2020.