A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem

• Published in: Neurocomputing (Amsterdam) Vol. 390; pp. 1 - 11
• Main Authors: Gu, Shenshen, Hao, Tao, Yao, Hanmei
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 21.05.2020
• Subjects: Deep reinforcement learning; Pointer network; Supervised learning; UBQP; Deep reinforcement learning; Pointer network; UBQP; Supervised learning
• ISSN: 0925-2312; 1872-8286
• DOI: 10.1016/j.neucom.2019.06.111

Combinatorial optimization problems have been widely used in various fields. And many types of combinatorial optimization problems can be generalized into the model of unconstrained binary quadratic programming (UBQP). Therefore, designing an effective and efficient algorithm for UBQP problems will also contribute to solving other combinatorial optimization problems. Pointer network is an end-to-end sequential decision structure and combines with deep learning technology. With the utilization of the structural characteristics of combinatorial optimization problems and the ability to extract the rule behind the data by deep learning, pointer network has been successfully applied to solve several classical combinatorial optimization problems. In this paper, a pointer network based algorithm is designed to solve UBQP problems. The network model is trained by supervised learning (SL) and deep reinforcement learning (DRL) respectively. Trained pointer network models are evaluated by self-generated benchmark dataset and ORLIB dataset respectively. Experimental results show that pointer network model trained by SL has strong learning ability to specific distributed dataset. Pointer network model trained by DRL can learn more general distribution data characteristics. In other words, it can quickly solve problems with great generalization ability. As a result, the framework proposed in this paper for UBQP has great potential to solve large scale combinatorial optimization problems.