메뉴 건너뛰기




Volumn 62, Issue , 2015, Pages 237-256

Heuristics for a continuous multi-facility location problem with demand regions

Author keywords

Facility location problems; Hyperbolic smoothing; Minimum sum of squares clustering; Second order cone programming

Indexed keywords

MATHEMATICAL PROGRAMMING; POLYNOMIAL APPROXIMATION; SITE SELECTION;

EID: 84937974527     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.09.001     Document Type: Article
Times cited : (31)

References (31)
  • 3
    • 0000281286 scopus 로고
    • Sur le point par lequel la somme des distances de n points donnés est minimum
    • E. Weiszfeld Sur le point par lequel la somme des distances de n points donnés est minimum Tohoku Math J 43 1937 355 386 10.1007/s10479-008-0352-z
    • (1937) Tohoku Math J , vol.43 , pp. 355-386
    • Weiszfeld, E.1
  • 4
    • 0000890585 scopus 로고
    • Optimum distribution of switching centers in a communication network and some related graph theoretic problems
    • S. Hakimi Optimum distribution of switching centers in a communication network and some related graph theoretic problems Oper Res 13 1965 462 475 10.1287/opre.13.3.462
    • (1965) Oper Res , vol.13 , pp. 462-475
    • Hakimi, S.1
  • 5
    • 84989530008 scopus 로고
    • Central facilities location
    • C. Revelle, and R. Swain Central facilities location Geogr Anal 2 1970 30 42 10.1111/j.1538-4632.1970.tb00142.x
    • (1970) Geogr Anal , vol.2 , pp. 30-42
    • Revelle, C.1    Swain, R.2
  • 6
    • 0021373110 scopus 로고
    • On the complexity of some common geometric location problems
    • N. Megiddo, and K. Supowit On the complexity of some common geometric location problems SIAM J Comput 13 1984 182 196 10.1137/0213014
    • (1984) SIAM J Comput , vol.13 , pp. 182-196
    • Megiddo, N.1    Supowit, K.2
  • 7
    • 84862009226 scopus 로고    scopus 로고
    • A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
    • J. Jiang, and X. Yuan A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand Comput Optim Appl 51 2012 1275 1295 10.1007/s10589-010-9392-9
    • (2012) Comput Optim Appl , vol.51 , pp. 1275-1295
    • Jiang, J.1    Yuan, X.2
  • 8
    • 84979421327 scopus 로고
    • A computational procedure for optimally locating a facility with respect to several rectangular regions
    • R. Love A computational procedure for optimally locating a facility with respect to several rectangular regions J Reg Sci 12 1972 233 242 10.1111/j.1467-9787.1972.tb00345.x
    • (1972) J Reg Sci , vol.12 , pp. 233-242
    • Love, R.1
  • 9
    • 84979382425 scopus 로고
    • Optimal facility location with respect to several regions
    • C. Bennet, and A. Mirakhor Optimal facility location with respect to several regions J Reg Sci 14 1974 131 136 10.1111/j.1467-9787.1974.tb00435.x
    • (1974) J Reg Sci , vol.14 , pp. 131-136
    • Bennet, C.1    Mirakhor, A.2
  • 10
    • 84979445843 scopus 로고
    • A random locational equilibrium problem
    • L. Cooper A random locational equilibrium problem J Reg Sci 14 1974 47 54 10.1111/j.1467-9787.1974.tb00428.x
    • (1974) J Reg Sci , vol.14 , pp. 47-54
    • Cooper, L.1
  • 11
    • 0020203575 scopus 로고
    • Generalized Weber problem with rectangular regions
    • A. Aly, and A. Marucheck Generalized Weber problem with rectangular regions J Oper Res Soc 13 1982 983 989 10.2307/2581512
    • (1982) J Oper Res Soc , vol.13 , pp. 983-989
    • Aly, A.1    Marucheck, A.2
  • 13
    • 0031701060 scopus 로고    scopus 로고
    • The Weber problem with regional demand
    • E. Carrizosa, M. Munoz-Marquez, and J. Puerto The Weber problem with regional demand Eur J Oper Res 104 1998 358 365 10.1016/S0377-2217(97)00190-2
    • (1998) Eur J Oper Res , vol.104 , pp. 358-365
    • Carrizosa, E.1    Munoz-Marquez, M.2    Puerto, J.3
  • 14
    • 0036567960 scopus 로고    scopus 로고
    • Locating facilities by minimax relative to closest points of demand areas
    • J. Brimberg, and G. Wesolowsky Locating facilities by minimax relative to closest points of demand areas Comput Oper Res 29 2002 625 636 10.1016/S0305-0548(00)00106-4
    • (2002) Comput Oper Res , vol.29 , pp. 625-636
    • Brimberg, J.1    Wesolowsky, G.2
  • 15
    • 0036421122 scopus 로고    scopus 로고
    • Minisum location with closest Euclidean distances
    • J. Brimberg, and G. Wesolowsky Minisum location with closest Euclidean distances Ann Oper Res 11 2002 151 165 10.1023/A:1020901719463
    • (2002) Ann Oper Res , vol.11 , pp. 151-165
    • Brimberg, J.1    Wesolowsky, G.2
  • 16
    • 0030417601 scopus 로고    scopus 로고
    • The p-center location problem in an area
    • A. Suzuki, and Z. Drezner The p-center location problem in an area Locat Sci 4 1996 69 82 10.1016/S0966-8349(96)00012-5
    • (1996) Locat Sci , vol.4 , pp. 69-82
    • Suzuki, A.1    Drezner, Z.2
  • 17
    • 0034313423 scopus 로고    scopus 로고
    • Location models with groups of demand points
    • Z. Drezner, and G. Wesolowsky Location models with groups of demand points INFOR 38 2000 359 372 10.1080/07408170108936860
    • (2000) INFOR , vol.38 , pp. 359-372
    • Drezner, Z.1    Wesolowsky, G.2
  • 18
    • 33749024460 scopus 로고    scopus 로고
    • Minisum location problem with farthest Euclidean distances
    • J. Jiang, and X. Yuan Minisum location problem with farthest Euclidean distances Math Methods Oper Res 64 2006 285 308 10.1007/s00186-006-0084-2
    • (2006) Math Methods Oper Res , vol.64 , pp. 285-308
    • Jiang, J.1    Yuan, X.2
  • 19
    • 2342458706 scopus 로고    scopus 로고
    • Second order cone programming
    • F. Alizadeh, and D. Goldfarb Second order cone programming Math Program 95 2003 3 51 10.1007/s10107-002-0339-5
    • (2003) Math Program , vol.95 , pp. 3-51
    • Alizadeh, F.1    Goldfarb, D.2
  • 20
    • 0041940559 scopus 로고    scopus 로고
    • Applications of second-order cone programming
    • M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret Applications of second-order cone programming Linear Algebra Appl 284 1998 193 228 10.1016/S0024-3795(98)10032-0
    • (1998) Linear Algebra Appl , vol.284 , pp. 193-228
    • Lobo, M.1    Vandenberghe, L.2    Boyd, S.3    Lebret, H.4
  • 22
    • 84937976098 scopus 로고    scopus 로고
    • Mixed-integer second order cone programming: A survey
    • H. Benson, and U. Saglam Mixed-integer second order cone programming: a survey Tutor Oper Res 34 2005 11 10.1287/educ.1053.0000
    • (2005) Tutor Oper Res , vol.34 , pp. 11
    • Benson, H.1    Saglam, U.2
  • 23
    • 84897011962 scopus 로고    scopus 로고
    • IBM
    • IBM. Cplex optimizer (11.0). URL: (http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/), 2012.
    • (2012) Cplex Optimizer (11.0)
  • 24
    • 84867028133 scopus 로고    scopus 로고
    • Gurobi Optimization I
    • Gurobi Optimization I. Gurobi optimizer reference manual. URL: (http://www.gurobi.com), 2013.
    • (2013) Gurobi Optimizer Reference Manual
  • 25
    • 0001138339 scopus 로고
    • Heuristic methods for location-allocation problems
    • L. Cooper Heuristic methods for location-allocation problems SIAM Rev 6 1964 37 53 10.1137/1006005
    • (1964) SIAM Rev , vol.6 , pp. 37-53
    • Cooper, L.1
  • 26
    • 0347723781 scopus 로고    scopus 로고
    • A heuristic method for large-scale multi-facility location problems
    • Y. Levin, and A. Ben-Israel A heuristic method for large-scale multi-facility location problems Comput Oper Res 31 2004 257 272 10.1016/S0305-0548(02)00191-0
    • (2004) Comput Oper Res , vol.31 , pp. 257-272
    • Levin, Y.1    Ben-Israel, A.2
  • 27
    • 70450224675 scopus 로고    scopus 로고
    • The hyperbolic smoothing clustering method
    • A. Xavier The hyperbolic smoothing clustering method Pattern Recognit 43 2010 731 737 10.1016/j.patcog.2009.06.018
    • (2010) Pattern Recognit , vol.43 , pp. 731-737
    • Xavier, A.1
  • 31
    • 3142743708 scopus 로고    scopus 로고
    • Solving semidefinite-quadratic-linear programs using sdpt3
    • R. Tutuncu, K. Toh, and M. Todd Solving semidefinite-quadratic-linear programs using sdpt3 Math Program Ser B 95 2003 189 217 10.1007/s10107n-002-0347-5
    • (2003) Math Program ser B , vol.95 , pp. 189-217
    • Tutuncu, R.1    Toh, K.2    Todd, M.3


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