1992
DOI: 10.1007/bf02098180
|View full text |Cite
|
Sign up to set email alerts
|

Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

1996
1996
2018
2018

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 75 publications
(21 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…Abdulaal and LeBlanc (1979) introduced the CNDP with user equilibrium and presented a direct search algorithm. Suh and Kim (1992) presented a descent algorithm for non-linear bilevel problems. Due to the complexity of the problem, many metaheuristics were proposed in the literature.…”
Section: Discrete Network Design Problemmentioning
confidence: 99%
“…Abdulaal and LeBlanc (1979) introduced the CNDP with user equilibrium and presented a direct search algorithm. Suh and Kim (1992) presented a descent algorithm for non-linear bilevel problems. Due to the complexity of the problem, many metaheuristics were proposed in the literature.…”
Section: Discrete Network Design Problemmentioning
confidence: 99%
“…The bilevel programming problem (BLPP) has a wide variety of applications, and bilevel programming techniques have been applied with remarkable success in different domains such as decentralized resource planning [30], transport system planning [31], civil engineering [32], road network management [33], power market [34], economics, and management [35,36]. The existing methods for solving BP can be categorized as traditional method and heuristic (stochastic) method.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Returning, then, to the issues concerning the interpretation of the sensitivity analysis, the point we would make secondly is that at no stage shall we apply the interpretation of the sensitivity analysis as a gradient (or sub-gradient) of at = 0, as one may do, for example, in some applications to bi-level optimisation (Suh & Kim, 1992;Davis, 1994;Josefson & Patriksson, 2003;Patriksson, 2004). In particular, our algorithm in section 4.6 makes no explicit use of the sensitivity analysis as a gradient.…”
Section: Interpretations Of Sensitivity Analysismentioning
confidence: 99%