A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem

The current paper presents a neural network-based hybrid strategy that combines a Genetic Algorithm (GA) and a Dual Recurrent Neural Network (DRNN) for efficiently and accurately solving the quadratic-Bi-level Programming Problem (BLPP). In this model, the GA is used to handle the upper-level decisi...

Full description

Main Authors: WATADA, J., ROY, A., LI, J., WANG, B., WANG, S.
Format: Article
Institution: Universiti Teknologi Petronas
Record Id / ISBN-0: utp-eprints.29953 /
Published: Elsevier B.V. 2020
Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085470590&doi=10.1016%2fj.neucom.2020.04.013&partnerID=40&md5=1bd461f8f78c0012e83820b90629330b
http://eprints.utp.edu.my/29953/
Tags: Add Tag
No Tags, Be the first to tag this record!
id utp-eprints.29953
recordtype eprints
spelling utp-eprints.299532022-03-25T03:16:46Z A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem WATADA, J. ROY, A. LI, J. WANG, B. WANG, S. The current paper presents a neural network-based hybrid strategy that combines a Genetic Algorithm (GA) and a Dual Recurrent Neural Network (DRNN) for efficiently and accurately solving the quadratic-Bi-level Programming Problem (BLPP). In this model, the GA is used to handle the upper-level decision problem by choosing desirable solution candidates and passing them to the lower-level problem. Subsequently, in the lower-level, the parameterized-DRNN is used to determine possible optimal solutions. This combination offers several benefits such as being a parallel computing structure, the RNN offers faster convergence to the optimum for the lower-level decision problem and it also helps to quickly and accurately determining the global optimal. Moreover, the GA can quickly reach the global optima and can search without becoming stuck to the local optimal. Additionally, by choosing desirable initialization of parameters, the proposed algorithm reaches the optimum with higher accuracy. Apart from that, there are still a few utilizations of hybrid NN-based methods for solving BLPPs. Hence, we believe the proposed algorithm will contribute to solving quadratic-BLPPs involved in various engineering, management, and finance applications. The accuracy and efficiency of the proposed method have been found better than the existing and widely used approaches, while doing experimental verification using four well-known examples used in prior works. © 2020 Elsevier B.V. Elsevier B.V. 2020 Article NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085470590&doi=10.1016%2fj.neucom.2020.04.013&partnerID=40&md5=1bd461f8f78c0012e83820b90629330b WATADA, J. and ROY, A. and LI, J. and WANG, B. and WANG, S. (2020) A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem. Neurocomputing, 407 . pp. 136-154. http://eprints.utp.edu.my/29953/
institution Universiti Teknologi Petronas
collection UTP Institutional Repository
description The current paper presents a neural network-based hybrid strategy that combines a Genetic Algorithm (GA) and a Dual Recurrent Neural Network (DRNN) for efficiently and accurately solving the quadratic-Bi-level Programming Problem (BLPP). In this model, the GA is used to handle the upper-level decision problem by choosing desirable solution candidates and passing them to the lower-level problem. Subsequently, in the lower-level, the parameterized-DRNN is used to determine possible optimal solutions. This combination offers several benefits such as being a parallel computing structure, the RNN offers faster convergence to the optimum for the lower-level decision problem and it also helps to quickly and accurately determining the global optimal. Moreover, the GA can quickly reach the global optima and can search without becoming stuck to the local optimal. Additionally, by choosing desirable initialization of parameters, the proposed algorithm reaches the optimum with higher accuracy. Apart from that, there are still a few utilizations of hybrid NN-based methods for solving BLPPs. Hence, we believe the proposed algorithm will contribute to solving quadratic-BLPPs involved in various engineering, management, and finance applications. The accuracy and efficiency of the proposed method have been found better than the existing and widely used approaches, while doing experimental verification using four well-known examples used in prior works. © 2020 Elsevier B.V.
format Article
author WATADA, J.
ROY, A.
LI, J.
WANG, B.
WANG, S.
spellingShingle WATADA, J.
ROY, A.
LI, J.
WANG, B.
WANG, S.
A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
author_sort WATADA, J.
title A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
title_short A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
title_full A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
title_fullStr A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
title_full_unstemmed A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
title_sort dual recurrent neural network-based hybrid approach for solving convex quadratic bi-level programming problem
publisher Elsevier B.V.
publishDate 2020
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085470590&doi=10.1016%2fj.neucom.2020.04.013&partnerID=40&md5=1bd461f8f78c0012e83820b90629330b
http://eprints.utp.edu.my/29953/
_version_ 1741197326021558272
score 11.62408

Similar Items