A HEURISTIC ALGORITHM FOR SOLVING THE DISCRETE NETWORK DESIGN PROBLEM

Transportation investment is a difficult decision, especially in developing countries where numerous improvements are needed but only limited resources are available. Although many studies have suggested that the network design approach be used to solve the investment decision problem, yet the problem solving algorithms previously developed are still not sufficient to provide optimal solutions with reasonable computing cost, especially when working with large networks. In this paper we suggest a new heuristic algorithm which can be used by general planners to deal with medium and large network design problems. This algorithm is based on the concept of expected generalized travel cost, and is developed by incorporating the Poorzahedy's modified model (IRRD 259682) in an iterative optimization-assignment procedure. A small network which was used in other studies is chosen to test the efficiency and effectiveness of the algorithm. In addition, a real highway network with 305 links and 135 candidate additions/alternative improvements has also been applied, and the computational efficiency is presented. All the computing work was executed by using simple commercial packages with a PC-386 machine. The results conclude that their heuristic algorithm is very effective and is much more efficient than those developed in previous studies. An extended applicability of this algorithm for solving the network design problem with variable travel demand is also discussed. (A)

[1]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[2]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[3]  Michael Florian,et al.  Exact and approximate algorithms for optimal network design , 1979, Networks.

[4]  T. B. Boffey,et al.  Solving the optimal network problem , 1979 .

[5]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[6]  Terry L. Friesz,et al.  Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..

[7]  P. Bovy,et al.  Network Aggregation Effects upon Equilibrium Assignment Outcomes: An Empirical Investigation , 1983 .

[8]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[9]  Mark S. Daskin,et al.  NETWORK DESIGN APPLICATION OF AN EXTRACTION ALGORITHM FOR NETWORK AGGREGATION. , 1983 .

[10]  Bruce N. Janson,et al.  Heuristic ranking and selection procedures for network design problems , 1987 .

[11]  Giorgio Gallo,et al.  Lower planes for the network design problem , 1983, Networks.

[12]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[13]  Terry L. Friesz,et al.  TRANSPORTATION NETWORK EQUILIBRIUM, DESIGN AND AGGREGATION: KEY DEVELOPMENTS AND RESEARCH OPPORTUNITIES. IN: THE AUTOMOBILE , 1985 .

[14]  David E. Boyce,et al.  A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[15]  Yupo Chan,et al.  TRANSPORTATION-NETWORK DESIGN PROBLEM: APPLICATION OF A HIERARCHICAL SEARCH ALGORITHM , 1989 .

[16]  Yupo Chan.  TRANSPORTATION NETWORK INVESTMENT PROBLEM--A SYNTHESIS OF TREE-SEARCH ALGORITHMS , 1986 .

[17]  Jonathan F. Bard,et al.  An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem , 1983, Oper. Res..

[18]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[19]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[20]  R. Weischedel,et al.  Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .

[21]  Yupo Chan,et al.  A method to simplify network representation in transportation planning , 1976 .