Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/19590
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSinha, Ankur
dc.contributor.authorMalo, P.
dc.contributor.authorDeb, K.
dc.date.accessioned2017-06-22T18:24:30Z
dc.date.available2017-06-22T18:24:30Z
dc.date.issued2017
dc.identifier.citationSinha A., Malo P., Deb K. (2017). Approximated set-valued mapping approach for handling multiobjective bilevel problems. Computers and Operations Research, 77, 194-209.en_US
dc.identifier.urihttp://hdl.handle.net/11718/19590
dc.description.abstractA significant amount of research has been done on bilevel optimization problems both in the realm of classical and evolutionary optimization. However, the multiobjective extensions of bilevel programming have received relatively little attention from researchers in both the domains. The existing algorithms are mostly brute-force nested strategies, and therefore computationally demanding. In this paper, we develop insights into multiobjective bilevel optimization through theoretical progress made in the direction of parametric multiobjective programming. We introduce an approximated set-valued mapping procedure that would be helpful in the development of efficient evolutionary approaches for solving these problems. The utility of the procedure has been emphasized by incorporating it in a hierarchical evolutionary framework and assessing the improvements. Test problems with varying levels of complexity have been used in the experiments.en_US
dc.language.isoen_USen_US
dc.publisherElsevier Ltden_US
dc.subjectBilevel optimizationen_US
dc.subjectEvolutionary algorithmen_US
dc.subjectMultiobjective optimizationen_US
dc.titleApproximated set-valued mapping approach for handling multiobjective bilevel problemsen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Approximated set valued_Sinha_Computers and Operations Research_2017.pdf
  Restricted Access
1.68 MBAdobe PDFView/Open Request a copy


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.