An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems

Bilevel problems are widely used to describe the decision problems with hierarchical upper–lower-level structures in many economic fields. The bilevel optimisation problem (BLOP) is intrinsically NP-hard when its objectives and constraints are complex and the decision variables are large in scale at...

Full description

Bibliographic Details
Main Authors: Xing Bao, Titing Cui, Zhongliang Zheng, Haiyun Liu
Format: Article
Language:English
Published: Taylor & Francis Group 2019-01-01
Series:Ekonomska Istraživanja
Subjects:
knn
Online Access:http://dx.doi.org/10.1080/1331677X.2019.1656097
id doaj-1789b3b5322b4e19aaf71b53589a336a
record_format Article
spelling doaj-1789b3b5322b4e19aaf71b53589a336a2020-11-25T02:31:43ZengTaylor & Francis GroupEkonomska Istraživanja1331-677X1848-96642019-01-013213022303910.1080/1331677X.2019.16560971656097An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problemsXing Bao0Titing Cui1Zhongliang Zheng2Haiyun Liu3Zhejiang University of Finance and EconomicsKTH Royal Institute of TechnologyChina Agricultural UniversityTulane UniversityBilevel problems are widely used to describe the decision problems with hierarchical upper–lower-level structures in many economic fields. The bilevel optimisation problem (BLOP) is intrinsically NP-hard when its objectives and constraints are complex and the decision variables are large in scale at both levels. An efficient hybrid differential evolutionary algorithm for BLOP (HDEAB) is proposed where the optimal lower level value function mapping method, the differential evolutionary algorithm, k-nearest neighbours (KNN) and a nested local search are hybridised to improve the computational accuracy and efficiency. To show the performance of the HDEAB, numerical studies were conducted on SMD (Sinha, Maro and Deb) instances and an application example of optimising a venture capital staged-financing contract. The results demonstrate that the HDEAB outperforms the BLEAQ (bilevel evolutionary algorithm based on quadratic approximations) greatly in solving the BLOPs with different scales.http://dx.doi.org/10.1080/1331677X.2019.1656097bilevel optimisation problemdifferential evolutionary algorithmknnnested local search
collection DOAJ
language English
format Article
sources DOAJ
author Xing Bao
Titing Cui
Zhongliang Zheng
Haiyun Liu
spellingShingle Xing Bao
Titing Cui
Zhongliang Zheng
Haiyun Liu
An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
Ekonomska Istraživanja
bilevel optimisation problem
differential evolutionary algorithm
knn
nested local search
author_facet Xing Bao
Titing Cui
Zhongliang Zheng
Haiyun Liu
author_sort Xing Bao
title An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
title_short An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
title_full An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
title_fullStr An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
title_full_unstemmed An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
title_sort efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
publisher Taylor & Francis Group
series Ekonomska Istraživanja
issn 1331-677X
1848-9664
publishDate 2019-01-01
description Bilevel problems are widely used to describe the decision problems with hierarchical upper–lower-level structures in many economic fields. The bilevel optimisation problem (BLOP) is intrinsically NP-hard when its objectives and constraints are complex and the decision variables are large in scale at both levels. An efficient hybrid differential evolutionary algorithm for BLOP (HDEAB) is proposed where the optimal lower level value function mapping method, the differential evolutionary algorithm, k-nearest neighbours (KNN) and a nested local search are hybridised to improve the computational accuracy and efficiency. To show the performance of the HDEAB, numerical studies were conducted on SMD (Sinha, Maro and Deb) instances and an application example of optimising a venture capital staged-financing contract. The results demonstrate that the HDEAB outperforms the BLEAQ (bilevel evolutionary algorithm based on quadratic approximations) greatly in solving the BLOPs with different scales.
topic bilevel optimisation problem
differential evolutionary algorithm
knn
nested local search
url http://dx.doi.org/10.1080/1331677X.2019.1656097
work_keys_str_mv AT xingbao anefficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT titingcui anefficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT zhongliangzheng anefficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT haiyunliu anefficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT xingbao efficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT titingcui efficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT zhongliangzheng efficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
AT haiyunliu efficienthybriddifferentialevolutionaryalgorithmforzbileveloptimisationproblems
_version_ 1724822466430238720