A GRASP and path relinking heuristic for rural road network development

Journal of Heuristics

Volumn 11, Issue 1, 2005, Pages 89-108

  Scaparra, Maria P ^a   Church, Richard L ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

GRASP; Metaheuristics; Network design; Path relinking

Indexed keywords

COSTS; MATHEMATICAL MODELS; OPTIMIZATION; PLANNING; ROADS AND STREETS; TRANSPORTATION;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); METAHEURISTICS; NETWORK DESIGN; PATH RELINKING;

HEURISTIC METHODS;

EID: 18744406305     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10732-005-7000-4     Document Type: Article

References (32)

1. Abdulaal, M. and L.J. LeBlanc. ( 1979). "Continuous equilibrium network design models." Transportation Research B 13B, 19-32.
2. Aiex, R.M., M.G.C. Resende, P.M. Pardalos, and G. Toraldo. (2003). "GRASP with path relinking for the three-index assignment problem." INFORMS J. on Computing (to appear).
3. Antunes, A., A. Seco, and N. Pinto. (2003). "An accessibility-maximization approach to road network planning." Computer-Aided Civil and Infrastructure Engineering 18, 224-240.
4. Boyce, D.E., A. Farhi, and R. Weischedel. (1973). "Optimal network problem: A branch-and-bound algorithm." Environmental and Planning 5, 519-533.
5. Church, R.L. and M.P. Scaparra. (2003). A mixed integer programming formulation for a bi-objective rural road development problem. Working paper.
6. Current, J. and H. Min. (1986). "Multiobjective design of transportation networks: Taxonomy and annotation." European Journal of Operational Research 26, 187-201.
7. Dionne, R. and M. Florian. (1979). "Exact and approximate algorithms for optimal network design." Networks 9, 37-59.
8. Dreyfus, S.E. (1969). "An appraisal of some shortest path algorithms." Operations Research 17, 395-412.
9. Feng, C. and J.Y. Wu. (2003). "Highway investment planning model for equity issues." Journal of Urban Planning and Development 129(3), 161-176.
10. Feo, T.A. and M.G.C. Resende. (1989). "A probabilistic heuristic for a computationally difficult set covering problem." Operations Research Letters 8, 67-71.
11. Feo, T.A. and M.G.C. Resende. (1995). "Greedy randomized adaptive search procedures." Journal of Global Optimization 6, 109-133.
12. Festa, P. and M.G.C. Resende. (2001 ). "GRASP: An annotated bibliography." In C.C. Ribeiro and P, Hansen (eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 325-367.
13. Gallo, G. (1980). "Reoptimization procedures in shortest paths problems." Riv. Mat. Sci. Econom. Social. 3, 3-13.
14. Glover, F. (1996). "Tabu search and adaptive memory programming-Advances, applications and challenges." In R.S. Barr, R.V. Helgason, and J.L. Kennington (eds.), Interfaces in Computer Science and Operations Research, Boston: Kluwer, pp. 1-24.
15. Glover, F. (1999). "Scatter search and path relinking." In D. Come, M. Dorigo, and F. Glover (eds.), New Ideas in Optimisation. Wiley.
16. Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publishers.
17. Glover, F., M. Laguna, and R. Martí. (2000). "Fundamentals of scatter search and path relinking". Control and Cybernetics 39, 653-684.
18. Johnson, D.S., J.K. Lenstra, and A.H.G. Rinnooy Kan. (1978). "The complexity of the network design problem." Networks 8, 279-285.
19. Koski, J. (1985). "Defectiveness of weighting method in multicriteria optimization of structures." Communications in Applied Numerical Methods 1, 333-337.
20. Laguna, M. and R. Martí. ( 1999). "GRASP and path relinking for the 2-layer straight line crossing minimization." INFORMS Journal on Computing 11, 44-52.
21. Magnanti, T.L. and R.T. Wong. (1984). "Network design and transportation planning: Models and algorithms." Transportation Science 18(1), 1-55.
22. Meng, Q. and H. Yang. (2002). "Benefit distribution and equity in road network design." Transportation Research Part B 36, 19-35.
23. Pallottino, S. and M.G. Scutellà. (1997). "Dual algorithms for the shortest path tree problem." Networks 29, 125-133.
24. Pallottino, S. and M.G. Scutellà. (2003). "A new algorithm for reoptimizing shortest paths when the arc costs change." Operations Research Letters 31, 149-160.
25. Prais, M. and C.C. Ribeiro. (2000). "Reactive GRASP: An application to a Matrix Decomposition Problem in TDMA traffic assignment" INFORMS Journal on Computing 12(3), 164-176.
26. Resende, M.G.C. (1998). "Computing approximate solutions of the maximum covering problem using GRASP." Journal of Heuristics 4, 161-171.
27. Resende, M.G.C. and C.C. Ribeiro. (2002). "Greedy randomized adaptive search procedures." In F. Glover and G. Kochenberger (eds.), State-of-the-Art Handbook of Metaheuristics, Kluwer Academic Publishers, pp. 219-249.
28. Resende, M.G.C. and C.C. Ribeiro. (2003). "GRASP with path-relinking for private virtual circuit routing." Networks 41, 104-114.
29. Resende, M.G.C. and R.F. Werneck. (2002). "A GRASP with path-relinking for the p-median problem." Technical Report, AT&T Labs Research, Florham Park, NJ.
30. Ribeiro, C.C., E. Uchoa, and R.F. Werneck. (2002). "A hybrid GRASP with perturbations for the Steiner problem in graphs." INFORMS Journal on Computing 14, 228-246.
31. Sheffi, Y. (1985). Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Englewood Cliffs, NJ: Prentice-Hall.
32. Yang, H. and M.G.H. Bell. (1998). "Models and algorithms for road network design: A review and some new development." Transportation Reviews 18(3), 257-258.