Comparison of algorithms for solving a bi-level toll setting problem

International Journal of Innovative Computing, Information and Control

Volumn 6, Issue 8, 2010, Pages 3529-3549

  Kalashnikov, Vyacheslav ^a   Camacho, Fernando ^a   Askin, Ronald ^b   Kalashnykova, Nataliya ^c  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b Arizona State University   (United States)

^c UNIVERSIDAD AUTÓNOMA DE NUEVO LEÓN   (Mexico)

Author keywords

Bi level programming; Gradient approximation method; Nelder Mead algorithm; Optimum toll setting problem; Penalty function methods; Quasi Newton type method

Indexed keywords

BI-LEVEL PROGRAMMING; GRADIENT APPROXIMATION METHOD; NELDER-MEAD ALGORITHMS; OPTIMUM TOLL SETTING PROBLEM; PENALTY FUNCTION METHODS; QUASI-NEWTON;

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; MATHEMATICAL PROGRAMMING; SIGNAL FILTERING AND PREDICTION; TRANSPORTATION;

PROBLEM SOLVING;

EID: 77956237075     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. J. M. Araujo, A. C. Castro and E. T. F. Santos, An optimization-based approach for quasi- noninteracting control, ICIC Express Letters, vol.2, no.4, pp.395-399, 2008.
2. M. Didi-Biha, P. Marcotte and G. Savard, Path-based formulation of a bi-level toll setting problem, in Optimization with Multi-Valued Mappings: Theory, Applications and Algorithms, S. Dempe and V. Kalashnikov (eds.), Boston, Springer Science, 2006.
3. M. Fukushima, Equivalent differential optimization problems and descent methods for asymmetric variational inequality problems, Mathematical Programming, vol.53, no.1, pp.99-110, 1992.
4. T. Furusho, T. Nishi and M. Konishi, Distributed optimization method for simultaneous production scheduling and transportation routing in semiconductor fabrication bays, International Journal of Innovative Computing, Information and Control, vol.4, no.3, pp.559-578, 2008.
5. A. Grigoriev, S. Van Hoesel, A. Van Der Kraaji, M. Uetz and M. Bouhtou, Pricing network edges to cross a river, METEOR, Maastricht Research School of Economics of Technology and Organization, 2004.
6. M. Labbé, P. Marcotte and S. Savard, A bilevel model of taxation and its application to optimal highway pricing, Management Science, vol.44, no.12, pp.1608-1622, 1998.
7. D. Li, L. Qi and V. Roshchina, A new class of quasi-Newton updating formulas, Optimization Methods & Software, vol.23, no.2, pp.237-249, 2008.
8. C. Liu, New evolutionary algorithm for multi-objective constrained optimization, ICIC Express Let- ters, vol.2, no.4, pp.339-344, 2008.
9. P. Marcotte, A new algorithm for solving variational inequalities with application to the traffic assignment problem, Mathematical Programming, vol.33, no.3, pp.339-352, 1985.
10. P. Marcotte and J. P. Dussault, A sequential linear programming algorithm for solving monotone variational inequalities, SIAM Journal on Control and Optimization, vol.27, no.6, pp.1260-1278, 1989.
11. P. Marcotte, G. Savard and F. Semet, A bilevel programming approach to the traveling salesman problem, Operations Research Letters, vol.32, no.3, pp.240-248, 2004.
12. P. Marcotte and L. Zhu, Exact and inexact penalty methods for the generalized bi-level programming problem, Mathematical Programming, vol.74, no.2, pp.141-157, 1996.
13. A. Nelder and R. Mead, A simplex method for function minimization, Computer Journal, vol.7, no.3, pp.308-313, 1965.
14. S. Roch, G. Savard and P. Marcotte, Design and analysis of an algorithm for Stackelberg network pricing, Networks, vol.46, no.1, pp.57-67, 2005.
15. Y. Takeuchi, Optimization of linear observations for the stationary Kalman filter based on a general- ized water filling theorem, International Journal of Innovative Computing, Information and Control, vol.4, no.1, pp.211-230, 2008.
16. Y. Takeuchi and A. Hirata, A method of optimization of linear observations for the Kalman filter based on a generalized water filling theorem, International Journal of Innovative Computing, Information and Control, vol.5, no.1, pp.75-85, 2009.
17. Y. Yuan, A modified BFGS algorithm for unconstrained optimization, IMA Journal of Numerical Analysis, vol.11, no.3, pp.325-332, 1991.
18. Y. Yuan and R. Byrd, Non-quasi-Newton updates for constrained optimization, Journal of Compu- tational Mathematics, vol.13, pp.95-107, 1995.
19. Y. Yuan, From quasi-Newton methods to non-quasi-Newton methods, Progress in Natural Science, vol.7, pp.14-23, 1997.