An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems
In the current work, we devised a hybrid method involving a Double-Layer Neural Network (DLNN) for solving a quadratic Bi-Level Programming Problem (BLPP). For an efficient and effective solution of such problems, the proposed potential methodology includes an improved Artificial Bee Colony (ABC) al...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2020
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081092961&doi=10.1109%2fACCESS.2020.2967787&partnerID=40&md5=216d113b7d0835ce8125c73298f2c3b6 http://eprints.utp.edu.my/23424/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.utp.eprints.23424 |
---|---|
record_format |
eprints |
spelling |
my.utp.eprints.234242021-08-19T07:20:29Z An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems Watada, J. Roy, A. Wang, B. Tan, S.C. Xu, B. In the current work, we devised a hybrid method involving a Double-Layer Neural Network (DLNN) for solving a quadratic Bi-Level Programming Problem (BLPP). For an efficient and effective solution of such problems, the proposed potential methodology includes an improved Artificial Bee Colony (ABC) algorithm, a Hopfield Network (HN), and a Boltzmann Machine (BM). The improved ABC algorithm accommodates upper-level decision problems by selecting a set of potential solutions from all combinations of solutions. However, for lower-level decision problem, HN and BM are amalgamated to manifest a DLNN that initially generates its structure by choosing a limited number of units, and will subsequently converge to an optimal solution/unit among those units and hence, constitutes an effective, efficient solution technique.We compared the accuracy, computational time and effectiveness (ability to find the true optimum) of the proposed DLNN with improved-ABC, DLNN with PSO (where PSO replaces the improved-ABC in the upper-level problem of the proposed DLNN with improved-ABC), DLNN with GA (where GAreplaces the improved-ABC in the upper-level of the proposed algorithm) and other conventional approaches and found the proposed DLNN with improved-ABC can yield high quality global optimal solutions with higher accuracy in relatively smaller time. © 2013 IEEE. Institute of Electrical and Electronics Engineers Inc. 2020 Article NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081092961&doi=10.1109%2fACCESS.2020.2967787&partnerID=40&md5=216d113b7d0835ce8125c73298f2c3b6 Watada, J. and Roy, A. and Wang, B. and Tan, S.C. and Xu, B. (2020) An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems. IEEE Access, 8 . pp. 21549-21564. http://eprints.utp.edu.my/23424/ |
institution |
Universiti Teknologi Petronas |
building |
UTP Resource Centre |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Petronas |
content_source |
UTP Institutional Repository |
url_provider |
http://eprints.utp.edu.my/ |
description |
In the current work, we devised a hybrid method involving a Double-Layer Neural Network (DLNN) for solving a quadratic Bi-Level Programming Problem (BLPP). For an efficient and effective solution of such problems, the proposed potential methodology includes an improved Artificial Bee Colony (ABC) algorithm, a Hopfield Network (HN), and a Boltzmann Machine (BM). The improved ABC algorithm accommodates upper-level decision problems by selecting a set of potential solutions from all combinations of solutions. However, for lower-level decision problem, HN and BM are amalgamated to manifest a DLNN that initially generates its structure by choosing a limited number of units, and will subsequently converge to an optimal solution/unit among those units and hence, constitutes an effective, efficient solution technique.We compared the accuracy, computational time and effectiveness (ability to find the true optimum) of the proposed DLNN with improved-ABC, DLNN with PSO (where PSO replaces the improved-ABC in the upper-level problem of the proposed DLNN with improved-ABC), DLNN with GA (where GAreplaces the improved-ABC in the upper-level of the proposed algorithm) and other conventional approaches and found the proposed DLNN with improved-ABC can yield high quality global optimal solutions with higher accuracy in relatively smaller time. © 2013 IEEE. |
format |
Article |
author |
Watada, J. Roy, A. Wang, B. Tan, S.C. Xu, B. |
spellingShingle |
Watada, J. Roy, A. Wang, B. Tan, S.C. Xu, B. An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems |
author_facet |
Watada, J. Roy, A. Wang, B. Tan, S.C. Xu, B. |
author_sort |
Watada, J. |
title |
An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems |
title_short |
An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems |
title_full |
An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems |
title_fullStr |
An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems |
title_full_unstemmed |
An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems |
title_sort |
artificial bee colony-based double layered neural network approach for solving quadratic bi-level programming problems |
publisher |
Institute of Electrical and Electronics Engineers Inc. |
publishDate |
2020 |
url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081092961&doi=10.1109%2fACCESS.2020.2967787&partnerID=40&md5=216d113b7d0835ce8125c73298f2c3b6 http://eprints.utp.edu.my/23424/ |
_version_ |
1738656470020390912 |
score |
13.214268 |