메뉴 건너뛰기




Volumn 39, Issue 2, 2012, Pages 461-470

A hierarchical algorithm for the planar single-facility location routing problem

Author keywords

Heuristics; Location routing problem; Logistics; Weber problem

Indexed keywords

DATA SETS; END-POINTS; EUCLIDEAN DISTANCE; FACILITY LOCATIONS; HEURISTICS; HIERARCHICAL ALGORITHM; LOCAL SEARCH; LOCATION ROUTING PROBLEM; LOGISTICAL PROBLEMS; POTENTIAL SITES; WEBER PROBLEM;

EID: 79958080515     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.05.013     Document Type: Article
Times cited : (35)

References (34)
  • 1
    • 33845918053 scopus 로고    scopus 로고
    • Using clustering analysis in a capacitated location-routing problem
    • DOI 10.1016/j.ejor.2005.06.074, PII S0377221706000786
    • S. Barreto, C. Ferreira, J. Paixao, and B. Sousa Santos Using clustering analysis in a capacitated location-routing problem European Journal of Operational Research 179 2007 968 977 (Pubitemid 46038597)
    • (2007) European Journal of Operational Research , vol.179 , Issue.3 , pp. 968-977
    • Barreto, S.1    Ferreira, C.2    Paixao, J.3    Santos, B.S.4
  • 2
    • 57049188458 scopus 로고    scopus 로고
    • Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic
    • C. Prins, C. Prodhon, P. Soriano, A. Ruiz, and R. Wolfler-Calvo Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic Transportation Science 41 2007 470 483
    • (2007) Transportation Science , vol.41 , pp. 470-483
    • Prins, C.1    Prodhon, C.2    Soriano, P.3    Ruiz, A.4    Wolfler-Calvo, R.5
  • 3
    • 43949083771 scopus 로고    scopus 로고
    • What you should know about location modeling
    • DOI 10.1002/nav.20284
    • M.S. Daskin What you should know about location modeling Naval Research Logistics 55 2008 283 294 (Pubitemid 351702824)
    • (2008) Naval Research Logistics , vol.55 , Issue.4 , pp. 283-294
    • Daskin, M.S.1
  • 4
    • 36549015264 scopus 로고    scopus 로고
    • What you should know about the vehicle routing problem
    • DOI 10.1002/nav.20261
    • G. Laporte What you should know about the vehicle routing problem Naval Research Logistics 54 2007 811 819 (Pubitemid 350189025)
    • (2007) Naval Research Logistics , vol.54 , Issue.8 , pp. 811-819
    • Laporte, G.1
  • 5
    • 0000281286 scopus 로고
    • Sur le point pour lequel la somme des distances de n points donnes est minimum
    • E. Weiszfeld Sur le point pour lequel la somme des distances de n points donnes est minimum Tohoku Mathematical Journal 43 1937 355 386
    • (1937) Tohoku Mathematical Journal , vol.43 , pp. 355-386
    • Weiszfeld, E.1
  • 6
    • 0001138339 scopus 로고
    • Heuristic methods for location-allocation problems
    • L. Cooper Heuristic methods for location-allocation problems Siam Review 6 1964 37 53
    • (1964) Siam Review , vol.6 , pp. 37-53
    • Cooper, L.1
  • 7
    • 0002451051 scopus 로고
    • NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands
    • H.D. Sherali, and F.L. Nordai NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands Mathematics of Operations Research 13 1988 32 49
    • (1988) Mathematics of Operations Research , vol.13 , pp. 32-49
    • Sherali, H.D.1    Nordai, F.L.2
  • 9
    • 56549127623 scopus 로고    scopus 로고
    • Region-rejection based heuristics for the capaciated multi-source Weber problem
    • M. Luis, S. Salhi, and G. Nagy Region-rejection based heuristics for the capaciated multi-source Weber problem Computers and Operations Research 36 2009 2007 2017
    • (2009) Computers and Operations Research , vol.36 , pp. 2007-2017
    • Luis, M.1    Salhi, S.2    Nagy, G.3
  • 11
    • 0002016938 scopus 로고    scopus 로고
    • Consistency and robustness in location routing
    • S. Salhi, and G. Nagy Consistency and robustness in location routing Studies in Locational Analysis 13 1999 3 19
    • (1999) Studies in Locational Analysis , vol.13 , pp. 3-19
    • Salhi, S.1    Nagy, G.2
  • 12
  • 13
    • 21144468823 scopus 로고
    • Solving real-life vehicle routing problems efficiently using tabu search
    • F. Semet, and E. Taillard Solving real-life vehicle routing problems efficiently using tabu search Annals of Operations Research 41 1993 469 488
    • (1993) Annals of Operations Research , vol.41 , pp. 469-488
    • Semet, F.1    Taillard, E.2
  • 14
    • 0442295172 scopus 로고    scopus 로고
    • Restructuring of Swiss parcel delivery services
    • A. Bruns, A. Klose, and P. Stähly Restructuring of Swiss parcel delivery services OR Spectrum 22 2000 285 302
    • (2000) OR Spectrum , vol.22 , pp. 285-302
    • Bruns, A.1    Klose, A.2    Stähly, P.3
  • 15
    • 2942689958 scopus 로고    scopus 로고
    • An integrated multi-depot hub location vehicle routing model for network planning of parcel service
    • M. Wasner, and G. Zäpfel An integrated multi-depot hub location vehicle routing model for network planning of parcel service International Journal of Production Economics 90 2004 403 419
    • (2004) International Journal of Production Economics , vol.90 , pp. 403-419
    • Wasner, M.1    Zäpfel, G.2
  • 16
    • 52049103673 scopus 로고    scopus 로고
    • A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
    • D. Ambrosino, A. Sciomachen, and M. Grazia Scutellá A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem Computers and Operations Research 36 2009 442 460
    • (2009) Computers and Operations Research , vol.36 , pp. 442-460
    • Ambrosino, D.1    Sciomachen, A.2    Grazia Scutellá, M.3
  • 17
    • 0035393968 scopus 로고    scopus 로고
    • Constructive heuristics for the uncapacitated continuous location-allocation problem
    • M.D.H. Gamal, and S. Salhi Constructive heuristics for the uncapacitated continuous location-allocation problem Journal of the Operational Research Society 52 2001 821 829 (Pubitemid 32680569)
    • (2001) Journal of the Operational Research Society , vol.52 , Issue.7 , pp. 821-829
    • Gamal, M.D.H.1    Salhi, S.2
  • 19
    • 67349228754 scopus 로고    scopus 로고
    • Combined location-routing problems - A neural network approach
    • M. Schwardt, and K. Fischer Combined location-routing problems - a neural network approach Annals of Operations Research 167 2009 253 269
    • (2009) Annals of Operations Research , vol.167 , pp. 253-269
    • Schwardt, M.1    Fischer, K.2
  • 21
    • 65349166876 scopus 로고    scopus 로고
    • Local improvement in planar facility location using vehicle routing
    • S. Salhi, and G. Nagy Local improvement in planar facility location using vehicle routing Annals of Operations Research 167 2009 287 296
    • (2009) Annals of Operations Research , vol.167 , pp. 287-296
    • Salhi, S.1    Nagy, G.2
  • 23
    • 0000419596 scopus 로고
    • Scheduling of vehicle from central depot to a number of delivery points
    • G. Clarke, and J.W. Wright Scheduling of vehicle from central depot to a number of delivery points Operations Research 12 1964 568 581
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 24
    • 0019527621 scopus 로고
    • Exact algorithm for minimizing routing and operating costs in depot location
    • DOI 10.1016/0377-2217(81)90212-5
    • G. Laporte, and Y. Nobert An exact algorithm for minimizing routing and operating costs in depot location European Journal of Operational Research 6 1981 224 226 (Pubitemid 11466204)
    • (1981) European Journal of Operational Research , vol.6 , Issue.2 , pp. 224-226
    • Laporte Gilbert1    Nobert Yves2
  • 25
    • 22744457875 scopus 로고    scopus 로고
    • A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
    • DOI 10.1057/palgrave.jors.2601916
    • I.K. Altinel, and T. Öncan A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem Journal of the Operational Research Society 56 2005 954 961 (Pubitemid 41028656)
    • (2005) Journal of the Operational Research Society , vol.56 , Issue.8 , pp. 954-961
    • Altinel, I.K.1    Oncan, T.2
  • 27
    • 60649121332 scopus 로고    scopus 로고
    • A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
    • A. Imran, S. Salhi, and N.A. Wassan A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem European Journal of Operational Research 197 2009 509 518
    • (2009) European Journal of Operational Research , vol.197 , pp. 509-518
    • Imran, A.1    Salhi, S.2    Wassan, N.A.3
  • 29
    • 0039780231 scopus 로고
    • Multi-terminal vehicle-dispatching algorithm
    • B. Gillet, and J. Johnson Multi-terminal vehicle-dispatching algorithm Omega 4 1976 711 718
    • (1976) Omega , vol.4 , pp. 711-718
    • Gillet, B.1    Johnson, J.2
  • 31
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using minimum K-trees
    • M.L. Fisher Optimal solution of vehicle routing problems using minimum K-trees Operations Research 42 1994 626 642
    • (1994) Operations Research , vol.42 , pp. 626-642
    • Fisher, M.L.1
  • 32
    • 79958142808 scopus 로고    scopus 로고
    • 〈 http://neo.lcc.uma.es/radi-aeb/WebVRP/ 〉.


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