메뉴 건너뛰기




Volumn 218, Issue 3, 2012, Pages 829-837

Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation

Author keywords

Genetic algorithms; Heuristics; Network design; Relay assignment

Indexed keywords

COMPUTATIONAL EXPERIMENT; DISTRIBUTION SYSTEMS; HEURISTICS; LARGE SIZES; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; NETWORK EDGES; OPTICAL SIGNALS; PATH-BASED; PROBLEM-BASED; RELAY ASSIGNMENT; SET COVERING PROBLEM; SET COVERINGS; SIGNAL DEGRADATION;

EID: 84855818273     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.11.046     Document Type: Article
Times cited : (32)

References (22)
  • 1
    • 0026839532 scopus 로고
    • Using a hop-constrained model to generate alternative communication network design
    • A. Balakrishnan, and K. Altinkemer Using a hop-constrained model to generate alternative communication network design ORSA Journal on Computing 4 2 1992 192 205
    • (1992) ORSA Journal on Computing , vol.4 , Issue.2 , pp. 192-205
    • Balakrishnan, A.1    Altinkemer, K.2
  • 3
    • 77951210452 scopus 로고    scopus 로고
    • The regenerator location problem
    • S. Chen, I. Ljubic, and S. Raghavan The regenerator location problem Networks 55 3 2010 205 220
    • (2010) Networks , vol.55 , Issue.3 , pp. 205-220
    • Chen, S.1    Ljubic, I.2    Raghavan, S.3
  • 6
    • 0030283804 scopus 로고    scopus 로고
    • Multicommodity flow models for spanning trees with hop constraints
    • DOI 10.1016/0377-2217(95)00090-9
    • L. Gouveia Multicommodity flow models for spanning trees with hop constraints European Journal of Operational Research 95 1 1996 178 190 (Pubitemid 126391980)
    • (1996) European Journal of Operational Research , vol.95 , Issue.1 , pp. 178-190
    • Gouveia, L.1
  • 7
    • 2142795873 scopus 로고    scopus 로고
    • Network flow models for designing diameter-constrained minimum spanning and Steiner trees
    • L. Gouveia, and T.L. Magnanti Network flow models for designing diameter-constrained minimum spanning and Steiner trees Networks 41 3 2003 159 173
    • (2003) Networks , vol.41 , Issue.3 , pp. 159-173
    • Gouveia, L.1    Magnanti, T.L.2
  • 8
    • 0035427762 scopus 로고    scopus 로고
    • A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
    • DOI 10.1016/S0377-2217(00)00143-0, PII S0377221700001430
    • L. Gouveia, and C. Requejo A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem European Journal of Operational Research 132 3 2001 539 552 (Pubitemid 32487096)
    • (2001) European Journal of Operational Research , vol.132 , Issue.3 , pp. 539-552
    • Gouveia, L.1    Requejo, C.2
  • 10
    • 34447097414 scopus 로고    scopus 로고
    • Modeling and solving the rooted distance-constrained minimum spanning tree problem
    • DOI 10.1016/j.cor.2006.03.022, PII S0305054806001110
    • L. Gouveia, A. Paias, and D. Sharma Modeling and solving the rooted distance-constrained minimum spanning tree problem Computers and Operations Research 35 2 2008 600 613 (Pubitemid 47031476)
    • (2008) Computers and Operations Research , vol.35 , Issue.2 , pp. 600-613
    • Gouveia, L.1    Paias, A.2    Sharma, D.3
  • 11
    • 0000890583 scopus 로고
    • Optimum locations of switching centers and absolute centers and medians of graph
    • S.L. Hakimi Optimum locations of switching centers and absolute centers and medians of graph Operations Research 12 3 1964 450 459
    • (1964) Operations Research , vol.12 , Issue.3 , pp. 450-459
    • Hakimi, S.L.1
  • 12
    • 84888636011 scopus 로고    scopus 로고
    • A local search hybrid genetic algorithm approach to the network design problem with relay stations
    • S. Raghavan, B.L. Golden, E. Wasil, Springer New York
    • S. Kulturel-Konak, and A. Konak A local search hybrid genetic algorithm approach to the network design problem with relay stations S. Raghavan, B.L. Golden, E. Wasil, Telecommunications Modeling, Policy, and Technology 2008 Springer New York 311 324
    • (2008) Telecommunications Modeling, Policy, and Technology , pp. 311-324
    • Kulturel-Konak, S.1    Konak, A.2
  • 13
    • 24144437452 scopus 로고    scopus 로고
    • Optical network design with optical constraints in IP/WDM networks
    • DOI 10.1093/ietcom/e88-b.5.1898
    • L. Kwangil, and M.A. Shayman Optical network design with optical constraints in IP/WDM networks IEICE Transactions on Communications E88-B 5 2005 1898 1905 (Pubitemid 41228128)
    • (2005) IEICE Transactions on Communications , vol.E88-B , Issue.5 , pp. 1898-1905
    • Lee, K.1    Shayman, M.A.2
  • 14
    • 77955486913 scopus 로고
    • Reliable link topology/capacity design and routing in backbone telecommunication networks
    • LeBlanc, L., Reddoch, R., 1990. Reliable link topology/capacity design and routing in backbone telecommunication networks. In: First ORSA Telecommunications SIG Conference
    • (1990) First ORSA Telecommunications SIG Conference
    • Leblanc, L.1    Reddoch, R.2
  • 16
    • 0013245747 scopus 로고    scopus 로고
    • Optimizing amplifier placements in a multiwavelength optical LAN/MAN: The unequally powered wavelengths case
    • PII S1063669298095168
    • B. Ramamurthy, J. Iness, and B. Mukherjee Optimizing amplifier placements in a multiwavelength optical LAN/MAN: the unequally powered wavelengths case IEEE/ACM Transactions on Networking (TON) 6 6 1998 755 767 (Pubitemid 128745470)
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.6 , pp. 755-767
    • Ramamurthy, B.1    Iness, J.2    Mukherjee, B.3
  • 17
    • 0036498081 scopus 로고    scopus 로고
    • A simulated annealing approach to communication network design
    • DOI 10.1023/A:1013337324030
    • M. Randall, G. McMahon, and S. Sugden A simulated annealing approach to communication network design Journal of Combinatorial Optimization 6 1 2002 55 65 (Pubitemid 34130063)
    • (2002) Journal of Combinatorial Optimization , vol.6 , Issue.1 , pp. 55-65
    • Randall, M.1    McMahon, G.2    Sugden, S.3
  • 19
    • 81555201630 scopus 로고    scopus 로고
    • Strategic design and analysis of a relay network in truckload transportation
    • 10.1287/trsc.1100.0355
    • H. Uster, and P. Kewcharoenwong Strategic design and analysis of a relay network in truckload transportation Transportation Science 2011 89 90 10.1287/trsc.1100.0355
    • (2011) Transportation Science , pp. 89-90
    • Uster, H.1    Kewcharoenwong, P.2
  • 20
    • 33845316473 scopus 로고    scopus 로고
    • Strategic network design for multi-zone truckload shipments
    • DOI 10.1080/07408170600735504, PII NVW4P195N2X31115
    • H. Üster, and N. Maheshwari Strategic network design for multi-zone truckload shipments IIE Transactions 39 2 2007 177 189 (Pubitemid 44869871)
    • (2007) IIE Transactions (Institute of Industrial Engineers) , vol.39 , Issue.2 , pp. 177-189
    • Uster, H.1    Maheshwari, N.2
  • 21
    • 0042715453 scopus 로고    scopus 로고
    • The Steiner tree problem with hop constraints
    • S. Voss The Steiner tree problem with hop constraints Annals of Operations Research 86 0 1999 321 345
    • (1999) Annals of Operations Research , vol.86 , Issue.0 , pp. 321-345
    • Voss, S.1
  • 22
    • 0038167254 scopus 로고    scopus 로고
    • Regenerator placement and traffic engineering with restoration in GMPLS networks
    • E. Yetginer, and E. Karasan Regenerator placement and traffic engineering with restoration in GMPLS networks Photonic Network Communications 6 2 2003 139 149
    • (2003) Photonic Network Communications , vol.6 , Issue.2 , pp. 139-149
    • Yetginer, E.1    Karasan, E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.