Abstract
The motive behind this paper is to produce an NDP model that prescribes the final shape of a transportation network and the sequence and schedule of facility construction during the planning span as well. The proposed bi-level NDP model fills the gap between existing NDP models and practitioners’ needs because, in practice, planners have to select investment projects on a year-by-year basis. Conversely, existing models suggest only the optimal network configuration for a planning horizon. A genetic algorithm and a simulated annealing algorithm are proposed along with an exhaustive search algorithm as solution algorithms. Testing these algorithms with an example problem revealed that the simulated annealing worked superiorly to the genetic algorithm. The paper also demonstrates that the model is applicable to a real world problem by showing that the computational time needed to solve the example problem is not prohibitively large.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anandalingam G, Friesz TL (1992) Hierarchical optimization: an introduction. In: Anandalingam G, Friesz TL, Baltzer JC (eds) Hierarchical optimization. Annals of operations research, vol 34: pp 1–11
Asakura Y, Sasaki T (1990) Formulation and feasibility test of optimal road network design model with endogenously determined travel demand. In: Proceedings of the 5th world congress on transport research, Japan, July, pp 351–365
Boyce DE and Janson BN (1980). A discrete transportation network design problem with combined trip distribution and assignment. Trans Res B 14: 147–154
Chen M and Alfa AS (1991). A network design algorithm using a stochastic incremental traffic assignment approach. Trans Sci 25: 215–224
Cho H and Lo S (1999). Solving Bilevel network design problem using a linear reaction function without nondegeneracy assumption. Trans Res Rec 1667(Paper No. 99–1486): 96–106
Davis GA (1994). Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Trans Res B 28: 61–75
Friesz TL, Cho HJ, Mehta NJ, Nam K, Shah SJ and Tobin RL (1992). A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Trans Sci 26(1): 12–26
Friesz TL, Shah S and Bernstein D (1998). Disequilibrium network design: a new paradigm for transportation planning and control. In: (eds) In: Network infrastructure and the urban environment, pp 99–111. Springer, Heidelberg
Gao Z, Wu J and Sun H (2005). Solution Algorithm for the Bi-level Discrete Network Design Problem. Trans Res B 39: 479–495
Hillier FS and Lieberman GJ (2005). Introduction to operations research, 8th Edn. McGraw-Hill, New york
Kim TJ (1990). Advanced transport and spatial systems models: applications to Korea. Springer, Heidelberg
Kim BJ and Kim W (2006). An equilibrium network design model with a social cost function for multi-modal networks. Ann Reg Sci 40: 473–491
Kydes NA (2002) Constrained multigrid optimization techniques for solving continuous dynamic disequilibrium network design problems. Ph.D. Dissertation, George Mason University, Fairfax, VA
LeBlanc LJ and Boyce DE (1986). A Bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Trans Res B 20(3): 259–265
Lo HK and Szeto WY (2003). Time-dependent transport network design: a study on budget sensitivity. J East Asia Soc Trans Stud, 5: 1124–1139
Park K, Carter B (1994) On the effectiveness of genetic search in combinatorial optimization. Working Paper BU-CS-94-010, Computer Science Department, Boston University
Poorzahedy H and Turnquist MA (1982). Approximate algorithm for the discrete network design problem. Trans Res B 16(1): 45–55
Solanki RS, Gorti JK and Southworth F (1998). Using decomposition in a large-scale highway network design with a quasi-optimization heuristics. Trans Res B 32(2): 127–140
Suh S, Kim TJ (1992) Solving nonlinear Bilevel programming models of the equilibrium network design problem: a comparative review. In: Anandalingam G, Friesz TL, Baltzer JC (eds) Hierarchical Optimization. Annals of operations research, vol 34, pp 203–218
Szeto WY and Lo HK (2006). Transport network improvement and tolling strategies: the issue of generation equity. Trans Res A 40: 227–243
Williams HCWL and Lam WM (1991). Transport policy appraisal with equilibrium model 1: generalized traffic and highway investment benefits. Trans Res B 25(5): 253–279
Yang H and Bell MGH (1998). Models and algorithms for road network design: a review and some developments. Trans Rev 18: 257–278
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, B.J., Kim, W. & Song, B.H. Sequencing and scheduling highway network expansion using a discrete network design model. Ann Reg Sci 42, 621–642 (2008). https://doi.org/10.1007/s00168-007-0170-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00168-007-0170-2