Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5296 LNCS, Issue , 2008, Pages 158-174

  Leitner, Markus ^a,b   Raidl, Günther R ^b  

^a CARINTHIA UNIVERSITY OF APPLIED SCIENCES   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Greedy randomized adaptive search procedure; Lagrangian relaxation; Network design; Redundancy; Steiner tree problem; Survivable network design; Variable neighborhood search

Indexed keywords

FIBER OPTIC NETWORKS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; OPTIMIZATION; REDUNDANCY;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; LAGRANGIAN RELAXATION; NETWORK DESIGN; STEINER TREE PROBLEM; SURVIVABLE NETWORK DESIGN; VARIABLE NEIGHBORHOOD SEARCH;

TREES (MATHEMATICS);

EID: 57049164290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88439-2_12     Document Type: Conference Paper

References (21)

1. Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming 87(3), 385-399 (2000)
2. Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, Advances and trends in local search paradigms for optimization, pp. 433-458. Kluwer Academic Publishers, Dordrecht (1999)
3. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6(2), 109-133 (1995)
4. Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. In: Waldmann, K.H., Stocker, U.M. (eds.) Operations Research Proceedings 2006, pp. 197-202. Springer, Heidelberg (2007)
5. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum Press (1972)
6. Winter, P.: Steiner problem in networks: a survey. Networks 17(2), 129-167 (1987)
7. Segev, A.: The node-weighted Steiner tree problem. Networks 17(1), 1-17 (1987)
8. Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621-636 (1989)
9. Kerivin, H., Mahjoub, A.R.: Design of survivable networks: A survey. Networks 46(1), 1-21 (2005)
10. ILOG: CPLEX 10.0. (2006), http://www.ilog.com
11. Wagner, D., Pferschy, U., Mutzel, P., Raidl, G.R., Bachhiesl, P.: A directed cut model for the design of the last mile in real-world fiber optic networks. In: Fortz, B. (ed.) Proceedings of the International Network Optimization Conference 2007, Spa, Belgium, pp. 1-6, 103 (2007)
12. Chimani, M., Kandyba, M., Mutzel, P.: A new ILP formulation for 2-rootconnected prize-collecting Steiner networks. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 681-692. Springer, Heidelberg (2007)
13. Beasley, .I.E.: Lagrangean relaxation. In: Reeves, C. (ed.) Modern heuristic techniques in combinatorial problems, pp. 243-303. Blackwell Scientific Publications, Malden (1993)
14. Bahiense, L., Barahona, F., Porto, O.: Solving Steiner tree problems in graphs with Lagrangian relaxation. Journal of Combinatorial Optimization 7(3), 259-282 (2003)
15. Haouari, M., Siala, J.C.: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Computers and Operations Research 33(5), 1274-1288 (2006)
16. Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325-335 (1984)
17. Kar, K., Kodialam, M., Lakshman, T.V.: Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Transactions on Networking 11(5), 772-781 (2003)
18. Martins, S.L., Resende, M.G.C., Ribeiro, C.C., Pardalos, P.M.: A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization 17(1-4), 267-283 (2000)
19. Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27(3), 125-128 (1988)
20. Raidl, G.R.: A unified view on hybrid metaheuristics. In: Almeida, F., et al. (eds.) HM 2006. LNCS, vol. 4030, pp. 1-12. Springer, Heidelberg (2006)
21. Bachhiesl, P.: The OPT- and the SST-problems for real world access network design - basic definitions and test instances. Working Report 01/2005, Carinthia Tech Institue, Department of Telematics and Network Engineering, Klagenfurt, Austria (2005)