An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem

Transportation Research Part B: Methodological

Volumn 35, Issue 1, 2001, Pages 83-105

  Meng, Q ^a   Yang, H ^a   Bell, M G H ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Bilevel programming; Network design; Network equilibrium; Optimization

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; HIGHWAY SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION;

BILEVEL PROGRAMMING; CONTINUOUS NETWORK DESIGN PROBLEM; NETWORK EQUILIBRIUM;

MOTOR TRANSPORTATION;

NETWORK DESIGN;

EID: 0035192102     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(00)00016-3     Document Type: Article

References (43)

1. Continuous equilibrium network design models
2. A discrete transportation network design problem with combined trip distribution and assignment
3. A network design algorithm using a stochastic incremental traffic assignment approach
4. Traffic equilibria and variational inequalities
5. Exact local solution of the continuous network design problem via stochastic user equilibrium assignment
6. Game theory and transportation systems modeling
7. Optimal signal controls on congested networks
8. An equivalent optimization problem with combined multiclass distribution, assignment and modal split which obviates symmetry restriction
9. The multiobjective equilibrium network design problem revisited: A simulated annealing approach
10. Properties of the iterative optimization-equilibrium algorithm
11. A simulated annealing approach to the network design problem with variational inequality constraints
12. Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
13. Differentiable properties of the marginal function in mathematical programming
14. Bounding the solution of the continuous equilibrium network design problem
15. An algorithm for the discrete network design problem
16. Network optimization with continuous control parameters
17. Network design problem with congestion effects: A case of bi-level programming
18. Efficient implementation of heuristic for the continuous network design problems
19. Exact and inexact penality methods for the generalized bilevel programming problems
20. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
21. The traffic assignment problem: Models and methods
22. Approximate algorithms for the discrete network design problem
23. The convergence of equilibrium algorithms with predetermined step size
24. Nondifferentiable and two-level mathematical programming
25. Existence, uniqueness, and stability of traffic equilibria
26. Equilibrium decomposed optimization: A heuristic for the continuous equilibrium network design problem
27. Hybrid optimization in urban traffic networks
28. Sensitivity analysis for equilibrium network flows
29. Reserve capacity of a signal controlled road network
30. Sensitivity analysis for queuing equilibrium network flow and its application to traffic control
31. Sensitivity analysis for the elastic demand network equilibrium problem with applications
32. Models and algorithms for road network design: A review and some new developments
33. A capacity paradox in network design and how to avoid it
34. Highway pricing and capacity choice in a road network under a build-operate-transfer scheme
35. Traffic assignment and traffic control in general freeway-arterial corridor systems
36. An algorithm for the inflow control problem on urban freeway networks with user-optimal flows