메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1144-1153

A well-arranged simulated annealing approach for the location-routing problem with time windows

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TIME; LOCATION PLANNING; LOCATION ROUTING PROBLEM; LOW QUALITIES; ROUTE PLANNING; SEQUENTIAL METHODS; SINGLE STAGE; TABU SEARCH HEURISTIC;

EID: 84875548623     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2013.69     Document Type: Conference Paper
Times cited : (4)

References (21)
  • 1
    • 0000325698 scopus 로고
    • Integer programming methods, uses, computation
    • M.L. Balinski, "Integer programming methods, uses, computation", Management Science 12, INFORMS, 1965, pp. 253-313
    • (1965) Management Science 12, INFORMS , pp. 253-313
    • Balinski, M.L.1
  • 2
    • 84944273656 scopus 로고    scopus 로고
    • Vehicle routing with time windows, Part I: Route construction and local search algorithms
    • INFORMS
    • O. Braeysy and M. Gendreau, "Vehicle routing with time windows, Part I: Route construction and local search algorithms", Transportation Science 39(1), INFORMS, 2005, pp-119-139
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Braeysy, O.1    Gendreau, M.2
  • 3
    • 0442295172 scopus 로고    scopus 로고
    • Restructuring of Swiss parcel delivery services
    • Springer
    • A. Bruns, A. Klose, and P. Staehly, "Restructuring of Swiss parcel delivery services", OR Spectrum 22, Springer, 2000, pp. 285-302
    • (2000) OR Spectrum , vol.22 , pp. 285-302
    • Bruns, A.1    Klose, A.2    Staehly, P.3
  • 4
    • 0035400636 scopus 로고    scopus 로고
    • A multi-depot, multiple-vehicle, location-routing problem with stochastically processed demands
    • Elsevier
    • Y. Chan, W.B. Carter, and M.D. Burns, "A multi-depot, multiple-vehicle, location-routing problem with stochastically processed demands", Computers & Operations Research 28, Elsevier, 2001, pp. 803-826
    • (2001) Computers & Operations Research , vol.28 , pp. 803-826
    • Chan, Y.1    Carter, W.B.2    Burns, M.D.3
  • 5
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke and J.W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points", Operations Research 12, INFORMS, 1964, pp. 568-581
    • (1964) Operations Research 12, INFORMS , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 6
    • 80054088497 scopus 로고    scopus 로고
    • The single-stage location routing problem with time windows
    • Springer
    • H.I. Guenduez, "The Single-Stage Location Routing Problem with Time Windows", Lecture Notes in Computer Science 6971, Springer, 2011, pp. 407-428
    • (2011) Lecture Notes in Computer Science , vol.6971 , pp. 407-428
    • Guenduez, H.I.1
  • 8
    • 36148975708 scopus 로고    scopus 로고
    • Resource extension functions: Properties, inversion, and generalization to segments
    • Springer
    • I. Irnich, "Resource extension functions: properties, inversion, and generalization to segments", OR Spectrum 30, Springer, 2008, pp. 113-148
    • (2008) OR Spectrum , vol.30 , pp. 113-148
    • Irnich, I.1
  • 9
    • 0006218433 scopus 로고
    • A comparative study of heuristics for a two-level routing-location problem
    • Elsevier
    • S.K. Jacobsen, O.B.G. Madsen, "A comparative study of heuristics for a two-level routing-location problem", European Journal of Operational Research 5, Elsevier, 1980, pp. 378-387
    • (1980) European Journal of Operational Research , vol.5 , pp. 378-387
    • Jacobsen, S.K.1    Madsen, O.B.G.2
  • 11
    • 0000369468 scopus 로고
    • A heuristic program for locating warehouses
    • INFORMS
    • M.J. Kuehn and A.A. Hamburger, "A heuristic program for locating warehouses", Management Science 9, INFORMS, 1963, pp. 643-666
    • (1963) Management Science , vol.9 , pp. 643-666
    • Kuehn, M.J.1    Hamburger, A.A.2
  • 12
    • 0022463446 scopus 로고
    • Covergence of an annealing algorithm
    • Springer
    • M. Lundy and A. Mees, "Covergence of an Annealing Algorithm", Mathematical Programming 34, Springer, 1986, pp. 111-124
    • (1986) Mathematical Programming , vol.34 , pp. 111-124
    • Lundy, M.1    Mees, A.2
  • 13
    • 0032632191 scopus 로고    scopus 로고
    • The U.S. army national guards mobile training simulators location
    • INFORMS
    • K.G. Murty, P.A. Djang, "The U.S. army national guards mobile training simulators location", Operations Research 47(2), INFORMS, 1999, pp. 175-183
    • (1999) Operations Research , vol.47 , Issue.2 , pp. 175-183
    • Murty, K.G.1    Djang, P.A.2
  • 14
    • 0030244403 scopus 로고    scopus 로고
    • Nested heuristic methods for the location-routeing problem
    • Palgrave Macmillan
    • G. Nagy and S. Salhi, "Nested heuristic methods for the location-routeing problem", Journal of the Operational Research Society 47(9), Palgrave Macmillan, 1996, pp. 1166-1174
    • (1996) Journal of the Operational Research Society , vol.47 , Issue.9 , pp. 1166-1174
    • Nagy, G.1    Salhi, S.2
  • 15
    • 33750442870 scopus 로고    scopus 로고
    • Location-routing: Issues, models and methods
    • Elsevier
    • G. Nagy and S. Salhi, "Location-routing: Issues, models and methods", European Journal of Operational Research 177, Elsevier, 2007, pp. 649-672
    • (2007) European Journal of Operational Research , vol.177 , pp. 649-672
    • Nagy, G.1    Salhi, S.2
  • 16
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • Springer
    • I.H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem", Annals of Operations Research 41, Springer, 1993, pp. 421-451
    • (1993) Annals of Operations Research , vol.41 , pp. 421-451
    • Osman, I.H.1
  • 17
    • 43949150040 scopus 로고
    • Capacitated clustering problems by hybrid simulated annealing and tabu search
    • Wiley
    • I.H. Osman and N. Christofides, "Capacitated clustering problems by hybrid simulated annealing and tabu search", International Transactions in Operations Research I, Wiley, 1994, pp. 317-336
    • (1994) International Transactions in Operations Research , vol.1 , pp. 317-336
    • Osman, I.H.1    Christofides, N.2
  • 18
    • 0022267384 scopus 로고
    • A unified warehouse locationrouting
    • Elsevier
    • J. Perl and M.S. Daskin, "A unified warehouse locationrouting", Transport Research Part B 19B(5), Elsevier, 1985, pp. 381-396
    • (1985) Transport Research Part B , vol.19 B , Issue.5 , pp. 381-396
    • Perl, J.1    Daskin, M.S.2
  • 19
    • 0024620616 scopus 로고
    • The effect of ignoring routes when locating depots
    • Elsevier
    • S. Salhi and G.K. Rand, "The effect of ignoring routes when locating depots", European Journal of Operational Research 39, Elsevier, 1989, pp. 150-156
    • (1989) European Journal of Operational Research , vol.39 , pp. 150-156
    • Salhi, S.1    Rand, G.K.2
  • 21
    • 80054057320 scopus 로고    scopus 로고
    • An integrated multi-depot hublocation vehicle routing model for network planning of parcel service
    • Elsevier
    • M. Wasner, G. Zaepfner, "An integrated multi-depot hublocation vehicle routing model for network planning of parcel service", Operations Research Letters 20, Elsevier, 2004, pp. 403-419
    • (2004) Operations Research Letters , vol.20 , pp. 403-419
    • Wasner, M.1    Zaepfner, G.2


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