A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem

The multiobjective unconstrained binary quadratic programming problem is an important combinatorial optimization problem with both theory and practical values. Until now, several efforts have been made to design metaheuristic methods to solve the problem. However, designing such effective methods is...

Full description

Saved in:
Bibliographic Details
Published in:International journal of cognitive informatics & natural intelligence Vol. 18; no. 1; pp. 1 - 17
Main Authors: Zhou, Ying, Kong, Lingjing, Liu, Yong, Cai, Yiqiao, Liu, Shaopeng
Format: Journal Article
Language:English
Published: Hershey IGI Global 01.01.2024
Subjects:
Artificial neural networks
Combinatorial analysis
Deep learning
Design optimization
Genetic algorithms
Heuristic
Heuristic methods
Informatics
Information technology
Machine learning
Multiple objective analysis
Neural networks
Optimization
Pareto optimum
Quadratic programming
ISSN:1557-3958, 1557-3966
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The multiobjective unconstrained binary quadratic programming problem is an important combinatorial optimization problem with both theory and practical values. Until now, several efforts have been made to design metaheuristic methods to solve the problem. However, designing such effective methods is not trivial and heavily depends on experts' specific knowledge. Meanwhile, due to the iterative nature of metaheuristic methods, they require a long time to find high-quality solutions. From the perspective of machine learning, this paper proposes a deep reinforcement learning method to solve the problem. The method can automatically learn effective heuristics from a large amount of data, thus decreasing the need for experts' knowledge. Meanwhile, by leveraging the power of GPU, the method can quickly obtain high-quality solutions for a batch of instances. Experimental results show the proposed method outperforms two classical metaheuristic methods in terms of solution quality and running time for solving the problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1557-3958
1557-3966
DOI:10.4018/IJCINI.361012