IDEAS home Printed from https://ideas.repec.org/a/taf/reroxx/v32y2019i1p3022-3039.html
   My bibliography  Save this article

An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems

Author

Listed:
  • Xing Bao
  • Titing Cui
  • Zhongliang Zheng
  • Haiyun Liu

Abstract

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.

Suggested Citation

  • Xing Bao & Titing Cui & Zhongliang Zheng & Haiyun Liu, 2019. "An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems," Economic Research-Ekonomska Istraživanja, Taylor & Francis Journals, vol. 32(1), pages 3022-3039, January.
    • Handle: RePEc:taf:reroxx:v:32:y:2019:i:1:p:3022-3039
    DOI: 10.1080/1331677X.2019.1656097
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1331677X.2019.1656097
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/1331677X.2019.1656097?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:reroxx:v:32:y:2019:i:1:p:3022-3039. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rero .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.