메뉴 건너뛰기




Volumn 71, Issue , 2015, Pages 32-55

Regenerator location problem and survivable extensions: A hub covering location perspective

Author keywords

Branch and cut; Hub location; Regenerator location; Survivable network design

Indexed keywords

INTEGER PROGRAMMING; OPTICAL COMMUNICATION; TELECOMMUNICATION NETWORKS;

EID: 84911408061     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2014.10.004     Document Type: Article
Times cited : (26)

References (76)
  • 6
    • 84893357194 scopus 로고    scopus 로고
    • The reliable hub-and-spoke design problem: Models and algorithms
    • optimization-online.org.
    • An, Y., Zhang, Y., Zeng, B., 2011. The reliable hub-and-spoke design problem: Models and algorithms, optimization-online.org.
    • (2011)
    • An, Y.1    Zhang, Y.2    Zeng, B.3
  • 7
    • 84945437601 scopus 로고    scopus 로고
    • The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques
    • (to appear in print)
    • Azizi N., Chauhan S., Salhi S., Vidyarthi N. The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques. Computers & Operations Research 2014, http://dx.doi.org/10.1016/j.cor.2014.05.012 (to appear in print).
    • (2014) Computers & Operations Research
    • Azizi, N.1    Chauhan, S.2    Salhi, S.3    Vidyarthi, N.4
  • 9
    • 67349254528 scopus 로고    scopus 로고
    • A tabu-based heuristic for the hub covering problem over incomplete hub networks
    • Calik H., Alumur S., Kara B., Karasan O. A tabu-based heuristic for the hub covering problem over incomplete hub networks. Computers & Operations Research 2009, 36:3088-3096.
    • (2009) Computers & Operations Research , vol.36 , pp. 3088-3096
    • Calik, H.1    Alumur, S.2    Kara, B.3    Karasan, O.4
  • 10
    • 0028259333 scopus 로고
    • Integer programming formulations of discrete hub location problems
    • Campbell J. Integer programming formulations of discrete hub location problems. European Journal of Operational Research 1994, 72:387-405.
    • (1994) European Journal of Operational Research , vol.72 , pp. 387-405
    • Campbell, J.1
  • 12
    • 27544484180 scopus 로고    scopus 로고
    • Hub arc location problems: Part i - Introduction and results
    • Campbell J., Ernst A., Krishnamoorthy M. Hub arc location problems: Part i - Introduction and results. Management Science 2005, 51:1540-1555.
    • (2005) Management Science , vol.51 , pp. 1540-1555
    • Campbell, J.1    Ernst, A.2    Krishnamoorthy, M.3
  • 13
    • 27544495247 scopus 로고    scopus 로고
    • Hub arc location problems: Part ii - Formulations and optimal algorithms
    • Campbell J., Ernst A., Krishnamoorthy M. Hub arc location problems: Part ii - Formulations and optimal algorithms. Management Science 2005, 51:1556-1571.
    • (2005) Management Science , vol.51 , pp. 1556-1571
    • Campbell, J.1    Ernst, A.2    Krishnamoorthy, M.3
  • 14
    • 84861801133 scopus 로고    scopus 로고
    • Twenty-five years of hub location research
    • Campbell J., O'Kelly M. Twenty-five years of hub location research. Transportation Science 2012, 46:153-169.
    • (2012) Transportation Science , vol.46 , pp. 153-169
    • Campbell, J.1    O'Kelly, M.2
  • 15
    • 0039728003 scopus 로고
    • Continuous and discrete demand hub location problems
    • Campbell J.F. Continuous and discrete demand hub location problems. Transportation Research Part B 1993, 27:473-482.
    • (1993) Transportation Research Part B , vol.27 , pp. 473-482
    • Campbell, J.F.1
  • 16
    • 77951210452 scopus 로고    scopus 로고
    • The regenerator location problem
    • Chen S., Ljubić I., Raghavan S. The regenerator location problem. Networks 2009, 55:205-220.
    • (2009) Networks , vol.55 , pp. 205-220
    • Chen, S.1    Ljubić, I.2    Raghavan, S.3
  • 18
    • 77954457919 scopus 로고    scopus 로고
    • Single-assignment hub location problems with multiple capacity levels
    • Correia I., Nickel S., da Gama F.S. Single-assignment hub location problems with multiple capacity levels. Transportation Research Part B 2010, 44:1047-1066.
    • (2010) Transportation Research Part B , vol.44 , pp. 1047-1066
    • Correia, I.1    Nickel, S.2    da Gama, F.S.3
  • 21
    • 0034313847 scopus 로고    scopus 로고
    • Solving the two-connected network with bounded meshes problem
    • Fortz B., Labbé M., Maffioli F. Solving the two-connected network with bounded meshes problem. Operations Research 2000, 48:866-877.
    • (2000) Operations Research , vol.48 , pp. 866-877
    • Fortz, B.1    Labbé, M.2    Maffioli, F.3
  • 22
  • 25
    • 84907684277 scopus 로고    scopus 로고
    • Benders decomposition, branch-and-cut and hybrid algorithms for the minimum connected dominating set problem
    • (to appear in print)
    • Gendron B., Lucena A., da Cunha A.S., Simonetti L. Benders decomposition, branch-and-cut and hybrid algorithms for the minimum connected dominating set problem. Informs Journal on Computing 2014, (to appear in print). 10.1287/ijoc.2013.0589.
    • (2014) Informs Journal on Computing
    • Gendron, B.1    Lucena, A.2    da Cunha, A.S.3    Simonetti, L.4
  • 29
    • 84868447311 scopus 로고    scopus 로고
    • Optimal deployment of public charging stations for plug-in hybrid electric vehicles
    • He F., Wu D., Yin Y., Guan Y. Optimal deployment of public charging stations for plug-in hybrid electric vehicles. Transportation Research Part B 2013, 47:87-101.
    • (2013) Transportation Research Part B , vol.47 , pp. 87-101
    • He, F.1    Wu, D.2    Yin, Y.3    Guan, Y.4
  • 31
    • 0034273546 scopus 로고    scopus 로고
    • On the single-assignment p- hub center problem: Models and linearizations
    • Kara B., Tansel B. On the single-assignment p- hub center problem: Models and linearizations. European Journal of Operational Reserach 2000, 125:648-655.
    • (2000) European Journal of Operational Reserach , vol.125 , pp. 648-655
    • Kara, B.1    Tansel, B.2
  • 32
    • 84893858500 scopus 로고    scopus 로고
    • Survivability in hierarchical telecommunications networks under dual homing
    • Karasan O., Mahjoub A., O.Ozkok H. Survivability in hierarchical telecommunications networks under dual homing. Informs Journal on Computing 2014, 26:1-15.
    • (2014) Informs Journal on Computing , vol.26 , pp. 1-15
    • Karasan, O.1    Mahjoub, A.2    Ozkok, H.O.3
  • 33
    • 23244465489 scopus 로고    scopus 로고
    • Design of survivable networks: A survey
    • Kerivin H., Mahjoub A. Design of survivable networks: A survey. Networks 2005, 46:1-21.
    • (2005) Networks , vol.46 , pp. 1-21
    • Kerivin, H.1    Mahjoub, A.2
  • 34
    • 84906787886 scopus 로고    scopus 로고
    • Benders decomposition algorithms for the fixed-charge relay network design in telecommunications
    • Kewcharoenwong P., Uster H. Benders decomposition algorithms for the fixed-charge relay network design in telecommunications. Telecommunication Systems 2014, 56:441-453.
    • (2014) Telecommunication Systems , vol.56 , pp. 441-453
    • Kewcharoenwong, P.1    Uster, H.2
  • 35
    • 84866922501 scopus 로고    scopus 로고
    • P-hub protection models for survivable hub network design
    • Kim H. P-hub protection models for survivable hub network design. Journal of Geographical Systems 2012, 14:437-461.
    • (2012) Journal of Geographical Systems , vol.14 , pp. 437-461
    • Kim, H.1
  • 36
    • 67650483306 scopus 로고    scopus 로고
    • Reliable p-hub location problems in telecommunication networks
    • Kim H., O'Kelly M. Reliable p-hub location problems in telecommunication networks. Geographical Analysis 2009, 41:283-306.
    • (2009) Geographical Analysis , vol.41 , pp. 283-306
    • Kim, H.1    O'Kelly, M.2
  • 38
    • 84855818273 scopus 로고    scopus 로고
    • Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation
    • Konak A. Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation. European Journal of Operational Research 2012, 218:829-837.
    • (2012) European Journal of Operational Research , vol.218 , pp. 829-837
    • Konak, A.1
  • 39
    • 84889887128 scopus 로고    scopus 로고
    • Two-edge disjoint survivable network design problem with relays: a hybrid genetic algorithm and lagrangian heuristic approach
    • Konak A. Two-edge disjoint survivable network design problem with relays: a hybrid genetic algorithm and lagrangian heuristic approach. Engineering Optimization 2014, 46:130-145.
    • (2014) Engineering Optimization , vol.46 , pp. 130-145
    • Konak, A.1
  • 40
    • 10144251795 scopus 로고    scopus 로고
    • The flow-refueling location problem for alternative-fuel vehicles
    • Kuby M., Lim S. The flow-refueling location problem for alternative-fuel vehicles. Socio-Economic Planning Sciences 2005, 39:125-145.
    • (2005) Socio-Economic Planning Sciences , vol.39 , pp. 125-145
    • Kuby, M.1    Lim, S.2
  • 41
    • 2542601639 scopus 로고    scopus 로고
    • The ring star problem: polyhedral analysis and exact algorithm
    • Labbé M., Laporte G., Martin I., Gonzalez J. The ring star problem: polyhedral analysis and exact algorithm. Networks 2004, 43:177-189.
    • (2004) Networks , vol.43 , pp. 177-189
    • Labbé, M.1    Laporte, G.2    Martin, I.3    Gonzalez, J.4
  • 44
    • 84876077867 scopus 로고    scopus 로고
    • Identifying critical facilities in hub-and-spoke networks: A hub interdiction median problem
    • Lei T. Identifying critical facilities in hub-and-spoke networks: A hub interdiction median problem. Geographical Analysis 2013, 45:105-122.
    • (2013) Geographical Analysis , vol.45 , pp. 105-122
    • Lei, T.1
  • 45
    • 77954087471 scopus 로고    scopus 로고
    • Reformulations and solution algorithms for the maximum leaf spanning tree problem
    • Lucena A., Maculan N., Simonetti L. Reformulations and solution algorithms for the maximum leaf spanning tree problem. Computational Management Science 2010, 7:289-311.
    • (2010) Computational Management Science , vol.7 , pp. 289-311
    • Lucena, A.1    Maculan, N.2    Simonetti, L.3
  • 46
    • 79952772427 scopus 로고    scopus 로고
    • Intermodal hub-and-spoke network design: Incorporating multiple stakeholders and multi-type containers
    • Meng Q., Wang X. Intermodal hub-and-spoke network design: Incorporating multiple stakeholders and multi-type containers. Transportation Research Part B 2011, 45:724-742.
    • (2011) Transportation Research Part B , vol.45 , pp. 724-742
    • Meng, Q.1    Wang, X.2
  • 47
    • 84890034335 scopus 로고    scopus 로고
    • A flexible reformulation of the refueling station location problem
    • MirHassani S., Ebrazi R. A flexible reformulation of the refueling station location problem. Transportation Science 2012, 47:617-628.
    • (2012) Transportation Science , vol.47 , pp. 617-628
    • MirHassani, S.1    Ebrazi, R.2
  • 48
    • 0024701993 scopus 로고
    • Methods for designing communications networks with certain two-connected survivability constraints
    • Monma C., Shallcross D. Methods for designing communications networks with certain two-connected survivability constraints. Operations Research 1989, 37:531-541.
    • (1989) Operations Research , vol.37 , pp. 531-541
    • Monma, C.1    Shallcross, D.2
  • 49
    • 84887822579 scopus 로고    scopus 로고
    • A corridor-centric approach to planning electric vehicle charging infrastructure
    • Nie Y.M., Ghamami M. A corridor-centric approach to planning electric vehicle charging infrastructure. Transportation Research Part B 2013, 57:172-190.
    • (2013) Transportation Research Part B , vol.57 , pp. 172-190
    • Nie, Y.M.1    Ghamami, M.2
  • 50
    • 0022908535 scopus 로고
    • Activity levels at hub facilities in interacting networks
    • O'Kelly M. Activity levels at hub facilities in interacting networks. Geographical Analysis 1986, 18:343-356.
    • (1986) Geographical Analysis , vol.18 , pp. 343-356
    • O'Kelly, M.1
  • 51
    • 0022721842 scopus 로고
    • The location of interacting hub facilities
    • O'Kelly M. The location of interacting hub facilities. Transportation Science 1986, 20:92-106.
    • (1986) Transportation Science , vol.20 , pp. 92-106
    • O'Kelly, M.1
  • 52
    • 0023561366 scopus 로고
    • A quadratic integer program for the location of interacting hub facilities
    • O'Kelly M. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 1987, 32:393-404.
    • (1987) European Journal of Operational Research , vol.32 , pp. 393-404
    • O'Kelly, M.1
  • 53
    • 29244451498 scopus 로고    scopus 로고
    • Dynamic lightpath provisioning with signal quality guarantees in survivable translucent optical networks
    • Ouyang Y., Zeng Q., Wei W. Dynamic lightpath provisioning with signal quality guarantees in survivable translucent optical networks. Optics Express 2005, 13:10457-10468.
    • (2005) Optics Express , vol.13 , pp. 10457-10468
    • Ouyang, Y.1    Zeng, Q.2    Wei, W.3
  • 54
    • 4243344590 scopus 로고    scopus 로고
    • Operations Research Scientist, Amazon.
    • Ozkok, O., 2014. Private communication. Operations Research Scientist, Amazon.
    • (2014) Private communication
    • Ozkok, O.1
  • 56
    • 72949115723 scopus 로고    scopus 로고
    • Physical layer impairment aware routing (pliar) in wdm optical networks: issues and challenges
    • Saradhi C., Subramaniam S. Physical layer impairment aware routing (pliar) in wdm optical networks: issues and challenges. IEEE Communications Surveys & Tutorials 2009, 11:109-130.
    • (2009) IEEE Communications Surveys & Tutorials , vol.11 , pp. 109-130
    • Saradhi, C.1    Subramaniam, S.2
  • 58
    • 77957252224 scopus 로고    scopus 로고
    • On sparse placement of regenerator nodes in translucent optical network
    • IEEE, Global Telecommunications Conference, 2008
    • Sen A., Murthy S., Bandyopadhyay S. On sparse placement of regenerator nodes in translucent optical network. IEEE GLOBECOM 2008, 1-6. IEEE.
    • (2008) IEEE GLOBECOM , pp. 1-6
    • Sen, A.1    Murthy, S.2    Bandyopadhyay, S.3
  • 60
    • 0031176702 scopus 로고    scopus 로고
    • A simple min-cut algorithm
    • Stoer M., Wagner F. A simple min-cut algorithm. Journal of the ACM 1997, 44:585-591.
    • (1997) Journal of the ACM , vol.44 , pp. 585-591
    • Stoer, M.1    Wagner, F.2
  • 61
    • 0001890228 scopus 로고
    • An integrated modeling framework for evaluating hub-and-spoke networks in truckload trucking
    • Taha T., Taylor G. An integrated modeling framework for evaluating hub-and-spoke networks in truckload trucking. Logistics and Transportation Review 1994, 30:141-166.
    • (1994) Logistics and Transportation Review , vol.30 , pp. 141-166
    • Taha, T.1    Taylor, G.2
  • 62
    • 0032812334 scopus 로고    scopus 로고
    • Development and analysis of alterntive dispatching methods in truckload trucking
    • Taylor G., Meinert T., Killian R., Whicker G. Development and analysis of alterntive dispatching methods in truckload trucking. Transportation Research Part E 1999, 35:191-205.
    • (1999) Transportation Research Part E , vol.35 , pp. 191-205
    • Taylor, G.1    Meinert, T.2    Killian, R.3    Whicker, G.4
  • 63
    • 81555201630 scopus 로고    scopus 로고
    • Strategic design and analysis of a relay network in truckload transportation
    • Uster H., Kewcharoenwong P. Strategic design and analysis of a relay network in truckload transportation. Transportation Science 2011, 45:505-523.
    • (2011) Transportation Science , vol.45 , pp. 505-523
    • Uster, H.1    Kewcharoenwong, P.2
  • 64
    • 33845316473 scopus 로고    scopus 로고
    • Strategic network design for multi-zone truckload shipments
    • Uster H., Maheshwari N. Strategic network design for multi-zone truckload shipments. IIE Transactions 2013, 39:177-189.
    • (2013) IIE Transactions , vol.39 , pp. 177-189
    • Uster, H.1    Maheshwari, N.2
  • 65
    • 84877321037 scopus 로고    scopus 로고
    • Mixed fleet dispatching in truckload relay network design optimization
    • Vergara H.A., Root S. Mixed fleet dispatching in truckload relay network design optimization. Transportation Research Part E 2013, 54:32-49.
    • (2013) Transportation Research Part E , vol.54 , pp. 32-49
    • Vergara, H.A.1    Root, S.2
  • 68
    • 77952671502 scopus 로고    scopus 로고
    • Locating passenger vehicle refueling stations
    • Wang Y.W., Wang C.R. Locating passenger vehicle refueling stations. Transportation Research Part E 2010, 46:791-801.
    • (2010) Transportation Research Part E , vol.46 , pp. 791-801
    • Wang, Y.W.1    Wang, C.R.2
  • 69
    • 84876448748 scopus 로고    scopus 로고
    • Simulation-optimization model for location of a public electric vehicle charging infrastructure
    • Xi X., Sioshansi R., Marano V. Simulation-optimization model for location of a public electric vehicle charging infrastructure. Transportation Research Part D 2013, 22:60-69.
    • (2013) Transportation Research Part D , vol.22 , pp. 60-69
    • Xi, X.1    Sioshansi, R.2    Marano, V.3
  • 70
    • 67349126984 scopus 로고    scopus 로고
    • The hierarchical hub median problem with single assignment
    • Yaman H. The hierarchical hub median problem with single assignment. Transportation Research Part B 2009, 43:643-658.
    • (2009) Transportation Research Part B , vol.43 , pp. 643-658
    • Yaman, H.1
  • 71
    • 34250674172 scopus 로고    scopus 로고
    • The latest arrival hub location problem for cargo delivery systems with stopovers
    • Yaman H., Kara B.Y., Tansel B. The latest arrival hub location problem for cargo delivery systems with stopovers. Transportation Research Part B 2007, 41:906-919.
    • (2007) Transportation Research Part B , vol.41 , pp. 906-919
    • Yaman, H.1    Kara, B.Y.2    Tansel, B.3
  • 72
    • 18144420843 scopus 로고    scopus 로고
    • Dynamic routing in translucent wdm optical networks: the intradomain case
    • Yang X., Ramamurthy B. Dynamic routing in translucent wdm optical networks: the intradomain case. Journal of Lightwave Technology 2005, 23:955-971.
    • (2005) Journal of Lightwave Technology , vol.23 , pp. 955-971
    • Yang, X.1    Ramamurthy, B.2
  • 73
    • 21244476317 scopus 로고    scopus 로고
    • Sparse regeneration in translucent wavelength-routed optical networks: Architecture, network design and wavelength routing
    • Yang X., Ramamurthy B. Sparse regeneration in translucent wavelength-routed optical networks: Architecture, network design and wavelength routing. Photonic Network Communications 2005, 10:39-53.
    • (2005) Photonic Network Communications , vol.10 , pp. 39-53
    • Yang, X.1    Ramamurthy, B.2
  • 74
    • 0038167254 scopus 로고    scopus 로고
    • Regenerator placement and traffic engineering with restoration in gmpls networks
    • Yetginer E., Karasan E. Regenerator placement and traffic engineering with restoration in gmpls networks. Photonic Network Communications 2003, 6:139-149.
    • (2003) Photonic Network Communications , vol.6 , pp. 139-149
    • Yetginer, E.1    Karasan, E.2
  • 75
    • 80053084269 scopus 로고    scopus 로고
    • Design of a reliable hub-and-spoke network using an interactive fuzzy goal programming
    • IEEE
    • Zarandi, M., Davari, S., 2011. Design of a reliable hub-and-spoke network using an interactive fuzzy goal programming. In: 2011 IEEE International Conference on Fuzzy Systems. IEEE, 2955-2959.
    • (2011) 2011 IEEE International Conference on Fuzzy Systems , pp. 2955-2959
    • Zarandi, M.1    Davari, S.2


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