Bilevel optimization is defined as a mathematical program, where an optimization problem
contains another optimization problem as a constraint. These problems have received …

A bilevel programming model represents the relationship in a specific decision process that
involves decisions within a hierarchical structure of two levels. The upper-level problem is …

Bilevel optimization problems are hierarchical optimization problems where the feasible
region of the so-called upper level problem is restricted by the graph of the solution set …

Multi-task optimization is an emerging research topic in computational intelligence
community. In this paper, we propose a novel evolutionary framework, many-task …

Bilevel optimization problems are a class of challenging optimization problems, which
contain two levels of optimization tasks. In these problems, the optimal solutions to the lower …

A common technique to solve bilevel optimization problems is by reducing the problem to a
single level and then solving it as a standard optimization problem. A number of single level …

Evolutionary algorithms (EAs) have been recognized as a promising approach for bilevel
optimization. However, the population-based characteristic of EAs largely influences their …

This paper develops a multi-modal competitive hub location pricing problem whose target is
the design of a transportation system for a company that plans to enter into a market with …

Abstract In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard
problem. Previous studies focus on approximation algorithms which search for an optimal …

Bilevel optimization refers to a hierarchical problem in which optimization needs to be
performed at two nested levels, namely the upper level and the lower level. The aim is to …