Network design: Selection and design of links and facility location

Transportation Research Part A: Policy and Practice

Volumn 37, Issue 3, 2003, Pages 241-256

  Drezner, Zvi ^a   Wesolowsky, George O ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; PROBLEM SOLVING; SIMULATED ANNEALING; TRAFFIC CONTROL;

TRANSPORTATION COSTS;

TRANSPORTATION;

FACILITY LOCATION;

EID: 0037353491     PISSN: 09658564     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-8564(02)00014-9     Document Type: Article

References (18)

1. Chiou, S.-W., 1999. Optimisation algorithms for equilibrium network design problem. In: 14th International Symposium on Transportation and Traffic Theory. Jerusalem, Israel, pp. 247-264.
2. Drezner, Z., Salhi, S., 2000. Selecting a good configuration of one-way and two-way routes using tabu search. Control and Cybernetics 29, 725-740.
3. Drezner, Z., Salhi, S., in press. Using hybrid metaheuristics for the one-way and two-way network design problem. Naval Research Logistics.
4. Drezner, Z., Wesolowsky, G.O., 1997. Selecting an optimum configuration of one-way and two-way routes. Transportation Science 31, 386-394.
5. Drezner, Z., Wesolowsky, G.O., submitted for publication. Solving a design-location problem using metaheuristics.
6. Friesz, T.L., Shah, S., Bernstein, D., 1998. Disequilibrium network design: a new paradigm for transportation planning and control. In: Network Infrastructure and the Urban Environment: Advances in Spatial Systems Modeling. Springer, Berlin.
7. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533-549.
8. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Dordrecht.
9. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Wokingham, England.
10. Hakimi, S.L., 1964. Optimal location of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450-459.
11. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
12. Kirkpatrick, S., Gelat, C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science 220, 671-680.
13. Melkote, S., Daskin, M.S., 2001. An integrated model of facility location and transportation network design. Transportation Research, Part A 35A, 515-538.
14. Mitchel, D.H., Smith, J.M., 2001. Topological network design of pedestrian networks. Transportation Research, Part B 35B, 107-135.
15. Pardalos, P.M., Du, D. (Eds.), 1998. Network Design: Connectivity and Facilities Location. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 40. American Mathematical Society, Providence, RI.
16. Salhi, S., 1998. Heuristic search methods. In: Marcoulides, G.A. (Ed.), Modern Methods for Business Research. Lawrence Erlbaum Associates, Mahwah, NJ.
17. Solanki, R.S., Gorti, J.K., Southworth, F., 1998. Using decomposition in large-scale highway network design with a quasi-optimization heuristic. Transportation Research, Part B 32B, 127-140.
18. Yang, H., 1998. Models and algorithms for road network design: a review and some new developments. Transport Reviews 18, 257-278.