Solving Bilevel Toll Assignment Problem by Penalty Function Algorithm

Author

Kalashnikov, Vyacheslav V. ; Kalashnykova, Nataliya I. ; Vallejo, José Fernando Camacho

Author_Institution

ITESM, Monterrey

Volume

3

fYear

2008

Firstpage

62

Lastpage

66

Abstract

The paper develops an inexact penalty function method to solve a bi-level multi-commodity optimal tolls problem. After reducing the original problem to a single-level one by solving an auxiliary linear or quadratic programming problem, the said mathematical program´s objective function is penalized and treated as an unconstrained minimization problem. Convergence of the proposed algorithm is also established.

Keywords

convergence; linear programming; minimisation; pricing; quadratic programming; transportation; bilevel multicommodity optimal tolls; bilevel toll assignment; convergence; linear programming; mathematical program; penalty function algorithm; quadratic programming; road pricing; unconstrained minimization; Constraint theory; Convergence; Cost function; Intelligent systems; Network topology; Pricing; Quadratic programming; Road transportation; Telecommunication traffic; Traffic control; bilevel toll assignment problem; inexact Newton algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on

Conference_Location

Kaohsiung

Print_ISBN

978-0-7695-3382-7

Type

conf

DOI

10.1109/ISDA.2008.223

Filename

4696438