An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm
Evolutionary Computation · 2010-09 · 18 (3) · 403-449
DOI: 10.1162/evco_a_00015 ↗Kurz gefasst
Fachartikel in der Zeitschrift Evolutionary Computation, 2010-09. Verfasst von Kalyanmoy Deb und 1 weiteren Autor:innen. Beteiligte Einrichtung: Finland Distinguished Professor (FiDiPro), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208016, India. deb@iitk.a…. Hauptthemen laut MEDLINE: Algorithms, Biological Evolution. Die Arbeit wurde bisher 153-mal zitiert (Crossref) und nennt 21 Literaturangaben.
Abstract (Originalsprache)
Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- Finland Distinguished Professor (FiDiPro), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208016, India. deb@iitk.ac.in
Zitieren
APA
Deb, K., & Sinha, A. (2010). An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm. Evolutionary Computation, 18(3), 403-449. https://doi.org/10.1162/evco_a_00015
Vancouver
Deb K, Sinha A. An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm. Evolutionary Computation. 2010;18(3):403-449. doi:10.1162/evco_a_00015
BibTeX
@article{Deb2010,
author = {Deb, Kalyanmoy and Sinha, Ankur},
title = {An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm},
journal = {Evolutionary Computation},
year = {2010},
volume = {18},
number = {3},
pages = {403--449},
doi = {10.1162/evco_a_00015}
}
EUVIMED