Two-edge disjoint survivable network design problem with relays: A hybrid genetic algorithm and Lagrangian heuristic approach

Engineering Optimization

Volumn 46, Issue 1, 2014, Pages 130-145

  Konak, Abdullah ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Genetic algorithm; Network design; Network survivability; Relays

Indexed keywords

HYBRID GENETIC ALGORITHMS; LAGRANGIAN HEURISTICS; NETWORK CONNECTIVITY; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; NETWORK SURVIVABILITY; RELAYS; SURVIVABLE NETWORK DESIGN;

HEURISTIC METHODS;

GENETIC ALGORITHMS;

EID: 84889887128     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/0305215X.2012.753436     Document Type: Article

References (33)

1. Andre, J., F. Bonnans, and L. Cornibert. 2009. "Optimization of Capacity Expansion Planning for Gas Transportation Networks." European Journal of Operational Research, 197, 1019-1027.
2. Balakrishnan, A., and K. Altinkemer. 1992. "Using a Hop-Constrained Model to Generate Alternative Communication Network Design." ORSA Journal on Computing, 4, 192-205.
3. Beasley, J. E. 1990. "A Lagrangian Heuristic for Set-Covering Problems." Naval Research Logistics, 37, 151-164.
4. Cabral, E. A., E. Erkut, G. Laporte, and R. A. Patterson. 2007. "The Network Design Problem With Relays." European Journal of Operational Research, 180, 834-844.
5. Chen, S., I. Ljubic, and S. Raghavan. 2010. "The Regenerator Location Problem." Networks, 55, 205-220.
6. Choplin, S. 2001. "Virtual Path Layout in ATM Path with Given Hop Count." In Proceedings of the First International Conference on Networking - Part II (ICN 2001), Colmar, France, 9-13 July. Berlin: Springer, 527-537.
7. Gouveia, L. 1996. "Multicommodity Flow Models for Spanning Trees with Hop Constraints." European Journal of Operational Research, 95, 178-190.
8. Gouveia, L., and T. L. Magnanti. 2003. "Network FlowModels for Designing Diameter-Constrained Minimum Spanning and Steiner Trees." Networks, 41, 159-173.
9. Gouveia, L., A. Paias, and D. Sharma. 2008. "Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem." Computers and Operations Research, 35, 600-613.
10. Gouveia, L., P. Patricio, A. F. de Sousa, and R. Valadas. 2003. "MPLS over WDM Network Design with Packet Level QoS Constraints Based on ILP Models." In IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, 30 March-3 April 2003. Piscataway, NJ: IEEE, 576-586.
11. Gouveia, L. and C. Requejo. 2001. "ANewLagrangean RelaxationApproach for the Hop-Constrained Minimum Spanning Tree Problem." European Journal of Operational Research, 132, 539-552.
12. Gouveia, L., L. Simonetti, and E. Uchoa. 2011. "Modeling Hop-Constrained and Diameter-Constrained Minimum Spanning Tree Problems as Steiner Tree Problems over Layered Graphs." Mathematical Programming, 128, 123-148.
13. Kabirian, A. and M. R. Hemmati. 2007. "A Strategic Planning Model for Natural Gas Transmission Networks." Energy Policy, 35, 5656-5670.
14. Konak, A. 2012. "Network Design Problem with Relays: A Genetic Algorithm with a Path-Based Crossover and a Set Covering Formulation." European Journal of Operational Research, 218, 829-837.
15. Konak, A., S. Kulturel-Konak, andA. Smith. 2009. "Two-Edge Disjoint Survivable Network Design Problem with Relays." In Operations Research and Cyber-Infrastructure (Operations Research/Computer Science Interfaces SeriesVol. 47), edited by J.W. Chinneck, B. Kristjansson and M. Saltzman. NewYork: Springer, 279-292.
16. Konak, A., and A. E. Smith. 2004. "Capacitated Network Design Considering Survivability: An Evolutionary Approach." Journal of Engineering Optimization, 36, 189-205.
17. Kulturel-Konak, S., and A. Konak. 2008. "A Local Search Hybrid Genetic Algorithm Approach to the Network Design Problem With Relay Stations." In Telecommunications Modeling, Policy, and Technology, edited by S. Raghavan, B. L. Golden and E. Wasil. NewYork: Springer, 311-324.
18. Kwangil, L., and M. A. Shayman. 2005. "Optical Network Design with Optical Constraints in IP/WDM Networks." IEICE Transactions on Communications, E88-B, 1898-1905.
19. LeBlanc L., and Reddoch R. 1990. "Reliable Link Topology/Capacity Design and Routing in Backbone Telecommunications Networks."Working paper 90-08, Vanderbilt University.
20. Leitner, M., M. Ruthmair, and G. R. Raidl. 2011. "Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. Network Optimization." In 5th International Conference, INOC 2011, 13-16 June 2011. Berlin: Springer, 124-138.
21. Magnanti, T. L., P. Mirchandani, and R. Vachani. 1995. "Modeling and Solving the Two-Facility Capacitated Network Loading Problem." Operations Research, 43, 142-157.
22. Monma, C. L., and D. F. Shallcross. 1989. "Methods for Designing Communications Networks with Certain Two- Connected Survivability Constraints." Operations Research, 37, 531-541.
23. Mukherjee, B. 2000. "WDM Optical Communication Networks: Progress and Challenges." IEEE Journal on Selected Areas in Communications, 18, 1810-1824.
24. Ramamurthy, B., J. Iness, and B. Mukherjee. 1997. "Minimizing the Number of Optical Amplifiers Needed to Support a Multi-wavelength OpticalLAN/MAN." In INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Kobe, Japan. Los Alamitos, CA, USA: IEEE Computer Society, 755-767.
25. Ramamurthy, B., J. Iness, and B. Mukherjee. 1998. "Optimizing Amplifier Placements in a Multiwavelength Optical LAN/MAN: The Unequally PoweredWavelengths Case." IEEE/ACM Transactions on Networking, 6, 755-767.
26. Randall, M., G. McMahon, and S. Sugden. 2002. "A Simulated Annealing Approach to Communication Network Design." Journal of Combinatorial Optimization, 6, 55-65.
27. Ruthmair, M., and G. R. Raidl. 2011. "A Layered Graph Model and an Adaptive Layers Framework to Solve Delay- Constrained Minimum Tree Problems." In Integer Programming and Combinatoral Optimization. 15th International Conference, IPCO 2011, 15-17 June 2011. Berlin: Springer, 376-388.
28. Suurballe, J. W., and R. E. Tarjan. 1984. "A Quick Method for Finding Shortest Pairs of Disjoint Paths." Networks, 14, 325-336.
29. Tabkhi, F., L. Pibouleau, C. Azzaro-Pantel, and S. Domenech. 2009. "Total Cost Minimization of a High-Pressure Natural Gas Network." Journal of Energy Resources Technology, 131, 043002 (12 pp.).
30. Taylor, G. D., G. L. Whicker, and J. S. Usher. 2001. "Multi-zone Dispatching in Truckload Trucking." Transportation Research Part E: Logistics and Transportation Review, 37, 375-390.
31. Voss, S. 1999. "The Steiner Tree Problem with Hop Constraints." Annals of Operations Research, 86, 321-345.
32. Winters, J. H., R. D. Gitlin, and S. Kasturia. 1993. "Reducing the Effects of Transmission Impairments in Digital Fiber Optic Systems." IEEE Communications Magazine, 31, 68-76.
33. Yetginer, E., and E. Karasan. 2003. "Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks." Photonic Network Communications, 6, 139-149.