Systematic evolutionary algorithm for general multilevel stackelberg problems with bounded decision variables (SEAMSP)

Ashenafi Teklay Woldemariam, Semu Mitiku Kassa

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Multilevel Stackelberg problems are nested optimization problems which reply optimally to hierarchical decisions of subproblems. These kind of problems are common in hierarchical decision making systems and are known to be NP-hard. In this paper, a systematic evolutionary algorithm has been proposed for such types of problems. A unique feature of the algorithm is that it is not affected by the nature of the objective and constraint functions involved in the problem as long as the problem has a solution. The convergence proof of the proposed algorithm is given for special problems containing non-convex and nondifferentiable functions. Moreover, a new concept of (ε, δ)-approximation for Stackelberg solutions is defined. Using this definition comparison of approximate Stackelberg solutions has been studied in this work. The numerical results on various problems demonstrated that the proposed algorithm is very much promising to multilevel Stackelberg problems with bounded constraints, and it can be used as a benchmark for a comparison of approximate results by other algorithms.

Original languageEnglish
Pages (from-to)771-790
Number of pages20
JournalAnnals of Operations Research
Volume229
Issue number1
DOIs
Publication statusPublished - 2014

Fingerprint

Stackelberg
Evolutionary algorithms
Optimization problem
Benchmark
NP-hard
Decision making
Approximation

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

@article{6e80c248bfd54be38a2da99ace6c5129,
title = "Systematic evolutionary algorithm for general multilevel stackelberg problems with bounded decision variables (SEAMSP)",
abstract = "Multilevel Stackelberg problems are nested optimization problems which reply optimally to hierarchical decisions of subproblems. These kind of problems are common in hierarchical decision making systems and are known to be NP-hard. In this paper, a systematic evolutionary algorithm has been proposed for such types of problems. A unique feature of the algorithm is that it is not affected by the nature of the objective and constraint functions involved in the problem as long as the problem has a solution. The convergence proof of the proposed algorithm is given for special problems containing non-convex and nondifferentiable functions. Moreover, a new concept of (ε, δ)-approximation for Stackelberg solutions is defined. Using this definition comparison of approximate Stackelberg solutions has been studied in this work. The numerical results on various problems demonstrated that the proposed algorithm is very much promising to multilevel Stackelberg problems with bounded constraints, and it can be used as a benchmark for a comparison of approximate results by other algorithms.",
author = "Woldemariam, {Ashenafi Teklay} and Kassa, {Semu Mitiku}",
year = "2014",
doi = "10.1007/s10479-015-1842-4",
language = "English",
volume = "229",
pages = "771--790",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer Netherlands",
number = "1",

}

Systematic evolutionary algorithm for general multilevel stackelberg problems with bounded decision variables (SEAMSP). / Woldemariam, Ashenafi Teklay; Kassa, Semu Mitiku.

In: Annals of Operations Research, Vol. 229, No. 1, 2014, p. 771-790.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Systematic evolutionary algorithm for general multilevel stackelberg problems with bounded decision variables (SEAMSP)

AU - Woldemariam, Ashenafi Teklay

AU - Kassa, Semu Mitiku

PY - 2014

Y1 - 2014

N2 - Multilevel Stackelberg problems are nested optimization problems which reply optimally to hierarchical decisions of subproblems. These kind of problems are common in hierarchical decision making systems and are known to be NP-hard. In this paper, a systematic evolutionary algorithm has been proposed for such types of problems. A unique feature of the algorithm is that it is not affected by the nature of the objective and constraint functions involved in the problem as long as the problem has a solution. The convergence proof of the proposed algorithm is given for special problems containing non-convex and nondifferentiable functions. Moreover, a new concept of (ε, δ)-approximation for Stackelberg solutions is defined. Using this definition comparison of approximate Stackelberg solutions has been studied in this work. The numerical results on various problems demonstrated that the proposed algorithm is very much promising to multilevel Stackelberg problems with bounded constraints, and it can be used as a benchmark for a comparison of approximate results by other algorithms.

AB - Multilevel Stackelberg problems are nested optimization problems which reply optimally to hierarchical decisions of subproblems. These kind of problems are common in hierarchical decision making systems and are known to be NP-hard. In this paper, a systematic evolutionary algorithm has been proposed for such types of problems. A unique feature of the algorithm is that it is not affected by the nature of the objective and constraint functions involved in the problem as long as the problem has a solution. The convergence proof of the proposed algorithm is given for special problems containing non-convex and nondifferentiable functions. Moreover, a new concept of (ε, δ)-approximation for Stackelberg solutions is defined. Using this definition comparison of approximate Stackelberg solutions has been studied in this work. The numerical results on various problems demonstrated that the proposed algorithm is very much promising to multilevel Stackelberg problems with bounded constraints, and it can be used as a benchmark for a comparison of approximate results by other algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84938593721&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938593721&partnerID=8YFLogxK

U2 - 10.1007/s10479-015-1842-4

DO - 10.1007/s10479-015-1842-4

M3 - Article

VL - 229

SP - 771

EP - 790

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -