메뉴 건너뛰기
Logistics Research
Volumn 2, Issue 1, 2010, Pages 3-11
A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem
Author keywords

Adaptive memory; Fixed fleet; Tabu search; Vehicle routing problem
Indexed keywords

EID: 80053486337     PISSN: 1865035X     EISSN: 18650368     Source Type: Journal    
DOI: 10.1007/s12159-010-0028-3     Document Type: Article
Times cited : (29)
References (25)
  • 2
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • Dantzig G-B, Ramser J-H (1959) The truck dispatching problem. Manage Sci 6(1):80-91
    • (1959) Manage Sci , vol.6 , Issue.1 , pp. 80-91
    • Dantzig, G.-B.1    Ramser, J.-H.2
  • 3
    • 0020504118 scopus 로고
    • Routing and scheduling of vehicles and crews. the state of the Art
    • Bodin L-D, Golden B-L, Assad A-A, Ball M-O (1983) Routing and scheduling of vehicles and crews. The state of the Art. Comp Oper Res 10:69-211
    • (1983) Comp Oper Res , vol.10 , pp. 69-211
    • Bodin, L.-D.1    Golden, B.-L.2    Assad, A.-A.3    Ball, M.-O.4
  • 4
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345-358
    • (1992) Eur J Oper Res , vol.59 , Issue.3 , pp. 345-358
    • Laporte, G.1
  • 5
    • 0026880159 scopus 로고
    • The traveling salesman problem: An overview of exact and approximate algorithms
    • Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):247-291
    • (1992) Eur J Oper Res , vol.59 , Issue.2 , pp. 247-291
    • Laporte, G.1
  • 6
    • 84897976837 scopus 로고
    • Computer aided routing CWI tract.75:M.W.P. Savelsbergh Mathematisch Centrum, Amsterdam, 1992, 134 pages, DFL.40.00, ISBN 90 6196 412 1
    • Laporte G (1993) Computer aided routing CWI tract.75:M.W.P. Savelsbergh Mathematisch Centrum, Amsterdam, 1992, 134 pages, DFL.40.00, ISBN 90 6196 412 1. Eur J Oper Res 71(1):143
    • (1993) Eur J Oper Res , vol.71 , Issue.1 , pp. 143
    • Laporte, G.1
  • 7
    • 84867946486 scopus 로고    scopus 로고
    • Models, relaxations and exact approaches for the capacitated vehicle routing problem
    • Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487-512
    • (2002) Discrete Appl Math , vol.123 , pp. 487-512
    • Toth, P.1    Vigo, D.2
  • 9
    • 0033380351 scopus 로고    scopus 로고
    • A tabu search heuristic for the heterogeneous fleet vehicle routing problem
    • DOI 10.1016/S0305-0548(98)00100-2, PII S0305054898001002
    • Gendreau M, Laporte G, Musaraganyi C, Taillard E-D (1999) A Tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comp Oper Res 26:1153-1173 (Pubitemid 30024491)
    • (1999) Computers and Operations Research , vol.26 , Issue.12 , pp. 1153-1173
    • Gendreau, M.1    Laporte, G.2    Musaraganyi, C.3    Taillard, E.D.4
  • 10
    • 33845365435 scopus 로고    scopus 로고
    • A column generation approach to the heterogeneous fleet vehicle routing problem
    • DOI 10.1016/j.cor.2005.08.002, PII S0305054805002650
    • Choi E, Tcha D-W (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2080-2095 (Pubitemid 44883327)
    • (2007) Computers and Operations Research , vol.34 , Issue.7 , pp. 2080-2095
    • Choi, E.1    Tcha, D.-W.2
  • 11
    • 0009012982 scopus 로고
    • Adaptation of some vehicle fleet mix heuristics
    • Salhi S, Sari M, Sadi D, Touati NAC (1992) Adaptation of some vehicle fleet mix heuristics. OMEGA 20:653-660
    • (1992) OMEGA , vol.20 , pp. 653-660
    • Salhi, S.1    Sari, M.2    Sadi, D.3    Touati, N.A.C.4
  • 12
    • 0001621542 scopus 로고    scopus 로고
    • Local search strategies for the VFMP
    • Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) Wiley, New York
    • Osman I-H, Salhi S (1996) Local search strategies for the VFMP. In: Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) Modern heuristic search methods. Wiley, New York, pp 131-153
    • (1996) Modern Heuristic Search Methods , pp. 131-153
    • Osman, I.-H.1    Salhi, S.2
  • 13
    • 33845512751 scopus 로고
    • Parallel iterative search methods for vehicle routing problems
    • Taillard E-D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661-673
    • (1993) Networks , vol.23 , pp. 661-673
    • Taillard, E.-D.1
  • 14
    • 0029362478 scopus 로고
    • Probabilistic diversification and intensification in local search for vehicle routing
    • Taillard E-D, Rochat Y (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147-167
    • (1995) J Heuristics , vol.1 , pp. 147-167
    • Taillard, E.-D.1    Rochat, Y.2
  • 15
    • 0033283556 scopus 로고    scopus 로고
    • A heuristic column generation method for the heterogeneous fleet VRP
    • Taillard E-D (1999) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33(1):1-14
    • (1999) RAIRO , vol.33 , Issue.1 , pp. 1-14
    • Taillard, E.-D.1
  • 16
    • 0141636308 scopus 로고    scopus 로고
    • A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
    • Tarantilis C, Kiranoudis C, Vassiliadis V (2004) A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152:148-158
    • (2004) Eur J Oper Res , vol.152 , pp. 148-158
    • Tarantilis, C.1    Kiranoudis, C.2    Vassiliadis, V.3
  • 17
    • 33846580155 scopus 로고    scopus 로고
    • A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
    • DOI 10.1016/j.cor.2005.10.015, PII S0305054805003382
    • Li F, Golden B-L, Wasil E-A (2007) A record to record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2734-2742 (Pubitemid 46176403)
    • (2007) Computers and Operations Research , vol.34 , Issue.9 , pp. 2734-2742
    • Li, F.1    Golden, B.2    Wasil, E.3
  • 18
    • 0025724220 scopus 로고
    • New heuristic for the fleet size and mix vehicle routing problem
    • DOI 10.1016/0305-0548(91)90028-P
    • Desrochers M, Verhoog T-W (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comp Oper Res 18:263-274 (Pubitemid 21651204)
    • (1991) Computers and Operations Research , vol.18 , Issue.3 , pp. 263-274
    • Desrochers, M.1    Verhoog, T.W.2
  • 19
    • 0000411214 scopus 로고
    • Tabu search-Part I. ORSA
    • Glover F (1989) Tabu search-Part I. ORSA. J Comp 1(3):190-206
    • (1989) J Comp , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 20
    • 30744460146 scopus 로고    scopus 로고
    • Adaptive memory search for multidemand multidimensional knapsack problems
    • DOI 10.1016/j.cor.2005.07.007, PII S0305054805002297, Computers Operations on Tabu Search
    • Arntzen H, Hvattum L-M, Lokketangen A (2006) Adaptive memory search for multi demand multidimensional knapsack problems. Comp Oper Res 33:2508-2525 (Pubitemid 43098898)
    • (2006) Computers and Operations Research , vol.33 , Issue.9 , pp. 2508-2525
    • Arntzen, H.1    Hvattum, L.M.2    Lokketangen, A.3
  • 21
    • 84989487658 scopus 로고
    • Heuristics for integer programming using surrogate constraints
    • Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156-166
    • (1977) Decis Sci , vol.8 , Issue.1 , pp. 156-166
    • Glover, F.1
  • 22
    • 0027591102 scopus 로고
    • A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
    • Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331-340
    • (1993) Eur J Oper Res , vol.66 , pp. 331-340
    • Potvin, J.-Y.1    Rousseau, J.-M.2
  • 23
    • 0032662302 scopus 로고    scopus 로고
    • A route-neighborhood-based meta-heuristic for vehicle routing problem with time windows
    • Liu F-H, Shen S-Y (1999) A route-neighborhood-based meta-heuristic for vehicle routing problem with time windows. Eur J Oper Res 118:485-504
    • (1999) Eur J Oper Res , vol.118 , pp. 485-504
    • Liu, F.-H.1    Shen, S.-Y.2
  • 24
    • 56349104761 scopus 로고    scopus 로고
    • A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
    • Brandão J (2009) A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 195:716-728
    • (2009) Eur J Oper Res , vol.195 , pp. 716-728
    • Brandão, J.1
  • 25
    • 0001799407 scopus 로고    scopus 로고
    • The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results
    • Crainic T, Laporte G (eds) Kluwer, Boston
    • Golden B, Wasil E, Kelly J, Chao I-M (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33-56
    • (1998) Fleet Management and Logistics , pp. 33-56
    • Golden, B.1    Wasil, E.2    Kelly, J.3    Chao, I.-M.4

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