A hybrid lagrangian relaxation and tabu search method for interdependent-choice network design problems

Hybrid Algorithms for Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions

Volumn , Issue , 2011, Pages 294-324

  Xie, Chi ^a   Turnquist, Mark A ^b   Waller, S Travis ^c  

^a The University of Texas at Austin   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84899359391     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-61350-086-6.ch013     Document Type: Chapter

References (61)

1. Balakrishnan, A., Magnanti, T. L., & Mirchandani, P. (1994). Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science, 40(7), 846-867. doi:10.1287/mnsc.40.7.846
2. Baños, R., Gil, C., Agulleiro, J. I., & Rcca, J.(2007). A memetic algorithm for water distribution network design. Soft Computing in Industrial Applications, 39(4), 279-289. doi:10.1007/9783-540-70706-6_26x
3. Berger, D., Gendron, B., Potvin, J. Y., Raghavan, S., & Soriano, P. (2000). Tabu search for a network loading problem with multiple facilities. Journal of Heuristics, 6(2), 253-267. doi:10.1023/A:1009679511137
4. Borghetti, A., Frangioni, A., Lacalandra, F., Lodi, A., Martello, S., Nucci, C. A., & Trebbi, A. (2001). Lagrangian relaxation and tabu search approaches for the unit commitment problem. Proceedings of IEEE 2001 Power Tech Conference, Porto, Portugal, 397-413.
5. Boschetti, M., & Maniezzo, V. (2009). Benders decomposition, Lagrangian relaxation and metaheuristic design. Journal of Heuristics, 15(3), 283-312. doi:10.1007/s10732-007-9064-9
6. Boyce, D. E., Farhi, A., & Weischedel, R. (1973). Optimal network problem: A branch-and-bound algorithm. Environment and Planning, 5(4), 519-533. doi:10.1068/a050519
7. Cantarella, G. E., Pavone, G., & Vitetta, A. (2006). Heuristics for urban road network design: Lane layout and signal settings. European Journal of Operational Research, 175(3), 1682-1695. doi:10.1016/j.ejor.2005.02.034
8. Cordeau, J. F., Pasin, F., & Solomon, M. M. (2006). An integrated model for logistics network design. Annals of Operations Research, 144(1), 59-82. doi:10.1007/s10479-006-0001-3
9. Cova, T. J., & Johnson, J. P. (2003). A network flow model for lane-based evacuation routing. Transportation Research, 37A(7), 579-604.
10. Crainic, T. G., Gendreau, M., & Farvolden, J. M. (2000). A simplex-based tabu search method for capacitated network design. Journal on Computing, 12(3), 223-236.
11. Daganzo, C. F. (1982). Unconstrained extremal formulation of some transportation equilibrium problems. Transportation Science, 16(3), 332-360. doi:10.1287/trsc.16.3.332
12. Dionne, R., & Florian, M. (1979). Exact and approximate algorithms for optimal network design. Networks, 9(1), 37-59. doi:10.1002/net.3230090104
13. Drezner, Z., & Wesolowsky, G. O. (1997). Selecting an optimum configuration of one-way and two-way routes. Transportation Science, 31(4), 386-394. doi:10.1287/trsc.31.4.386
14. Drezner, Z., & Wesolowsky, G. O. (2003). Network design: Selection and design of links and facility location. Transportation Research, 37A(3), 241-256.
15. Filho, V. J. M. F., & Galvão, R. D. (1998). A tabu search heuristic for the concentrator location problem. Location Science, 6(1-4), 189-209. doi:10.1016/S0966-8349(98)00046-1
16. Gendreau, M. (2002). An Introduction to Tabu Search. Research Report, Centre de recherche sur les transports. Montréal, Québec, Canada: Université de Montréal.
17. Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40(10), 1276-1290. doi:10.1287/mnsc.40.10.1276
18. Geoffrion, A. M. (1974). Lagrangian relaxation for integer programming. Mathematical Programming Study, 2(1), 82-114.
19. Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management Science, 20(5), 822-844. doi:10.1287/mnsc.20.5.822
20. Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13(5), 533-549. doi:10.1016/0305-0548(86)90048-1
21. Glover, F., & Laguna, M. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers. doi:10.1007/978-1-4615-6089-0
22. Golding, D., & Kasperson, R. E. (1988). Emergency planning and nuclear power: Looking to the next accident. Land Use Policy, 5(1), 19-36. doi:10.1016/0264-8377(88)90004-X
23. Gouveia, L., & Telhada, J. (2001). An augmented arborescence formulation for the two-level network design problem. Annals of Operations Research, 106(1-4), 47-61. doi:10.1023/A:1014553523631
24. Grünert, T. (2002). Lagrangean tabu search. In C.C. Ribeiro & P. Hansen (Ed.), Essays and Surveys in Metaheuristics, 379-397. New York, NY: Springer.
25. Guihaire, V., & Hao, J. K. (2008). Transit network design and scheduling: A global review. Transportation Research, 42A(10), 1251-1273.
26. Hamza-Lup, G. L., Hua, K. A., Le, M., & Peng, R. (2004). Enhancing intelligent transportation systems to improve and support homeland security. Proceedings of the 7th IEEE Intelligent Transportation Systems Conference, Washington, DC, 250-255.
27. Hamza-Lup, G. L., Hua, K. A., & Peng, R. (2007). Leveraging e-transportation in real-time traffic evacuation management. Electronic Commerce Research and Applications, 6(4), 413-424. doi:10.1016/j.elerap.2006.12.002
28. Hoang, H. H. (1973). A computational approach to the selection of an optimal network. Management Science, 19(5), 488-498. doi:10.1287/mnsc.19.5.488
29. Hoang, H. H. (1982). Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition. IEEE Transactions on Automatic Control, 27(1), 164-169. doi:10.1109/TAC.1982.1102873
30. Jeon, K., Lee, J. S., Ukkusuri, S., & Waller, S. T. (2006). Selectorecombinative genetic algorithm to relax computational complexity of discrete network design problem. Transportation Research Record, 1964, 91-103. doi:10.3141/1964-11
31. Johnson, D. S., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1978). The complexity of the network design problem. Networks, 8(4), 279-285. doi:10.1002/net.3230080402
32. Jourdan, L., Basseur, M., & Talbi, E. G. (2009). Hybridizing exact methods and metaheuristics: A taxonomy. European Journal of Operational Research, 199(3), 620-629. doi:10.1016/j.ejor.2007.07.035
33. Kalafaras, G., & Peeta, S. (2010). Planning for evacuation: Insights from an efficient network design model. Journal of Infrastructure Systems, 15(1), 21-30. doi:10.1061/(ASCE)10760342(2009)15:1(21)
34. Kim, S., Shekhar, S., & Min, M. (2008). Contraflow transportation network reconfiguration for evacuation route planning. IEEE Transactions on Knowledge and Data Engineering, 20(8), 1115-1129. doi:10.1109/TKDE.2007.190722
35. LeBlanc, L. J. (1975). An algorithm for the discrete network design problem. Transportation Science, 9(3), 183-199. doi:10.1287/trsc.9.3.183
36. Lee, C. K., & Yang, K. I. (1994). Network design of one-way streets with simulated annealing. Papers in Regional Science, 73(2), 119-134. doi:10.1111/j.1435-5597.1994.tb00606.x
37. Magnanti, T. L., Mireault, P., & Wong, R. T. (1986). Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study, 26(2), 112-154.
38. Magnanti, T. L., & Wong, R. T. (1984). Network design and transportation planning: Models and algorithms. Transportation Science, 18(1), 1-55. doi:10.1287/trsc.18.1.1
39. Maher, M. J. (1992). SAM-A stochastic assignment model. In Griffiths, J. D. (Ed.), Mathematics in Transport Planning and Control. Oxford, UK: Oxford University Press.
40. Maher, M. J., & Hughes, P. C. (1997). A probitbased stochastic user equilibrium assignment model. Transportation Research, 31B(4), 341-355.
41. Meng, Q., Khoo, H. L., & Cheu, R. L. (2008). Microscopic traffic simulation model-based optimization approach for the contraflow lane configuration problem. Journal of Transportation Engineering, 134(1), 41-49. doi:10.1061/(ASCE)0733-947X(2008)134:1(41)
42. Mouskos, K. C. (1991). A Tabu-Based Heuristic Search Strategy to Solve a Discrete Transportation Equilibrium Network Design Problem. Ph.D. Thesis, Department of Civil, Architectural and Environmental Engineering, University of Texas at Austin, Austin, TX.
43. O'Kelly, M. E., & Miller, H. J. (1994). The hub network design problem: A review and synthesis. Journal of Transport Geography, 2(1), 31-40. doi:10.1016/0966-6923(94)90032-9
44. Ohlmann, J. W., & Bean, J. C. (2009). Resourceconstrained management of heterogeneous assets with stochastic deterioration. European Journal of Operational Research, 199(1), 198-208. doi:10.1016/j.ejor.2008.11.005
45. Poorzahedy, H., & Abulghasemi, F. (2005). Application of ant system to network design problem. Transportation, 32(3), 251-273. doi:10.1007/s11116-004-8246-7
46. Randazzo, C. D., Luna, H. P. L., & Mahey, P. (2001). Benders decomposition for local access network design with two technologies. Discrete Mathematics and Theoretical Computer Science, 4(2), 235-246.
47. Sheffi, Y. (1985). Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Englewood, NJ: Prentice Hall.
48. Sheffi, Y., & Powell, W. B. (1982). An algorithm for the equilibrium assignment problem with random link times. Networks, 12(2), 191-207. doi:10.1002/net.3230120209
49. Shekhar, S., & Kim, S. (2006). Contraflow Transportation Network Reconfiguration for Evacuation Route Planning. St. Paul, MS: CTS Project Report, Minnesota Department of Transportation.
50. Sherali, H. D., Carter, T. B., & Hobeika, A. G. (1991). A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions. Transportation Research, 25B(6), 439-452.
51. Talbi, E. G. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8(5), 541-564. doi:10.1023/A:1016540724870
52. Tuydes, H., & Ziliaskopoulos, A. K. (2006). Tabu-based heuristic approach for optimization of network evacuation contraflow. Transportation Research Record, 1964, 157-168. doi:10.3141/1964-17
53. Urbina, E., & Wolshon, B. (2003). National review of hurricane evacuation plans and policies: A comparison and contrast of state practices. Transportation Research, 37A(3), 257-275.
54. Wolshon, P. B., & Lambert, L. (2004). Convertible Roadways and Lanes: A Synthesis of Highway Practice. NCHRP Synthesis 340. Washington, DC: National Cooperative Highway Research Program, Transportation Research Board.
55. Wong, C. K., & Wong, S. C. (2002). Lane-based optimization of traffic equilibrium settings for area traffic control. Journal of Advanced Transportation, 36(3), 349-386. doi:10.1002/atr.5670360308
56. Wong, R. T. (1980). Worst-case analysis of network design problem heuristics. Journal of Algebraic and Discrete Methods, 1(1), 51-63. doi:10.1137/0601008
57. Wong, R. T. (1985). Transportation network research: Algorithmic and computational questions. Transportation Research, 19A(5/6), 436-438.
58. Xie, C., Lin, D. Y., & Waller, S. T. (2010). A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies. Transportation Research, 46E(3), 295-316.
59. Xie, C., & Turnquist, M. A. (2011). Lane-based evacuation network optimization: An integrated Lagrangian relaxation and tabu search approach. Transportation Research, 19C(1), 40-63.
60. Xie, C., Waller, S. T., & Kockelman, K. M. (2011). (in press). An intersection origin-destination flow optimization problem for evacuation network design. Transportation Research Record.
61. Xiong, Y., & Schneider, J. B. (1992). Transportation network design using a cumulative genetic algorithm and neural networks. Transportation Research Record, 1364, 37-44.