메뉴 건너뛰기
TOP
Volumn 20, Issue 1, 2012, Pages 99-118
A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
Author keywords

Generalized variable neighborhood search; Route duration; Stochastic service time; Stochastic vehicle routing
Indexed keywords

EID: 84859495085     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/s11750-011-0188-6     Document Type: Article
Times cited : (47)
References (23)
  • 1
    • 3843138356 scopus 로고    scopus 로고
    • A reactive variable neighborhood search for the vehicle routing problem with time windows
    • Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15: 347-368.
    • (2003) INFORMS J Comput , vol.15 , pp. 347-368
    • Bräysy, O.1
  • 2
    • 0024733174 scopus 로고
    • Generalized dynamic programming for stochastic combinatorial optimization
    • Carraway RL, Morin TL, Moskowitz H (1989) Generalized dynamic programming for stochastic combinatorial optimization. Oper Res 37: 819-829.
    • (1989) Oper Res , vol.37 , pp. 819-829
    • Carraway, R.L.1    Morin, T.L.2    Moskowitz, H.3
  • 3
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12: 568-581.
    • (1964) Oper Res , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 4
    • 0002535331 scopus 로고
    • New optimization heuristics: The great deluge algorithm and the record-to-record travel
    • Dueck G (1993) New optimization heuristics: The great deluge algorithm and the record-to-record travel. J Comput Phys 104: 86-92.
    • (1993) J Comput Phys , vol.104 , pp. 86-92
    • Dueck, G.1
  • 5
    • 56349100703 scopus 로고    scopus 로고
    • A variable neighborhood search algorithm for the open vehicle routing problem
    • Fleszar K, Osman I, Hindi KS (2009) A variable neighborhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195: 803-809.
    • (2009) Eur J Oper Res , vol.195 , pp. 803-809
    • Fleszar, K.1    Osman, I.2    Hindi, K.S.3
  • 6
    • 0031390388 scopus 로고    scopus 로고
    • Variable neighborhood search for the p-median
    • Hansen P, Mladenović N (1997) Variable neighborhood search for the p-median. Location Sci 5: 207-226.
    • (1997) Location Sci , vol.5 , pp. 207-226
    • Hansen, P.1    Mladenović, N.2
  • 7
    • 84891995513 scopus 로고    scopus 로고
    • Variable neighborhood search
    • E. K. Burke and G. Kendall (Eds.), Berlin: Springer
    • Hansen P, Mladenović N (2005) Variable neighborhood search. In: Burke EK, Kendall G (eds) Search methodologies. Springer, Berlin, pp 211-238.
    • (2005) Search Methodologies , pp. 211-238
    • Hansen, P.1    Mladenović, N.2
  • 8
    • 76849091335 scopus 로고    scopus 로고
    • Variable neighborhood search: methods and applications
    • Hansen P, Mladenović N, Pérez JAM (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175: 367-407.
    • (2010) Ann Oper Res , vol.175 , pp. 367-407
    • Hansen, P.1    Mladenović, N.2    Pérez, J.A.M.3
  • 9
    • 29144447717 scopus 로고    scopus 로고
    • Sequential search and its application to vehicle-routing problems
    • Irnich S, Funke B, Grünert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33: 2405-2429.
    • (2006) Comput Oper Res , vol.33 , pp. 2405-2429
    • Irnich, S.1    Funke, B.2    Grünert, T.3
  • 10
    • 0012284407 scopus 로고
    • A preference order dynamic program for a stochastic traveling salesman problem
    • Kao EPC (1978) A preference order dynamic program for a stochastic traveling salesman problem. Oper Res 26: 1033-1045.
    • (1978) Oper Res , vol.26 , pp. 1033-1045
    • Kao, E.P.C.1
  • 11
    • 0037294747 scopus 로고    scopus 로고
    • Stochastic vehicle routing with random travel times
    • Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37: 69-82.
    • (2003) Transp Sci , vol.37 , pp. 69-82
    • Kenyon, A.S.1    Morton, D.P.2
  • 12
    • 33846581449 scopus 로고    scopus 로고
    • An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
    • Kytöjoki J, Nuortio T, Bräysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34: 2743-2757.
    • (2007) Comput Oper Res , vol.34 , pp. 2743-2757
    • Kytöjoki, J.1    Nuortio, T.2    Bräysy, O.3    Gendreau, M.4
  • 13
    • 0027656329 scopus 로고
    • Designing collection routes through bank branches
    • Lambert V, Laporte G, Louveaux FV (1993) Designing collection routes through bank branches. Comput Oper Res 20: 783-791.
    • (1993) Comput Oper Res , vol.20 , pp. 783-791
    • Lambert, V.1    Laporte, G.2    Louveaux, F.V.3
  • 14
    • 0026900954 scopus 로고
    • The vehicle routing problem with stochastic travel times
    • Laporte G, Louveaux FV, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26: 161-170.
    • (1992) Transp Sci , vol.26 , pp. 161-170
    • Laporte, G.1    Louveaux, F.V.2    Mercure, H.3
  • 15
    • 0012270994 scopus 로고
    • On the solutions of stochastic traveling salesman problems
    • Leipälä (1978) On the solutions of stochastic traveling salesman problems. Eur J Oper Res 2: 291-297.
    • (1978) Eur J Oper Res , vol.2 , pp. 291-297
    • Leipälä1
  • 16
    • 77949568659 scopus 로고    scopus 로고
    • Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm
    • Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125: 137-145.
    • (2010) Int J Prod Econ , vol.125 , pp. 137-145
    • Li, X.1    Tian, P.2    Leung, S.C.H.3
  • 17
    • 58549116508 scopus 로고    scopus 로고
    • A heuristic method for the vehicle routing problem with backhauls and inventory
    • Liu S-C, Chung C-H (2009) A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manuf 20: 29-42.
    • (2009) J Intell Manuf , vol.20 , pp. 29-42
    • Liu, S.-C.1    Chung, C.-H.2
  • 18
    • 26644438136 scopus 로고    scopus 로고
    • A metaheuristic to solve a location-routing problem with non-linear costs
    • Melechovsky J, Prins C, Wolfler-Calvo R (2005) A metaheuristic to solve a location-routing problem with non-linear costs. J Heuristics 11: 375-391.
    • (2005) J Heuristics , vol.11 , pp. 375-391
    • Melechovsky, J.1    Prins, C.2    Wolfler-Calvo, R.3
  • 19
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097-1100.
    • (1997) Comput Oper Res , vol.24 , pp. 1097-1100
    • Mladenović, N.1    Hansen, P.2
  • 20
    • 0036175861 scopus 로고    scopus 로고
    • Using constraint-based operators to solve the vehicle routing problem with time windows
    • Rousseau L-M, Gendreau M, Pesant G (2002) Using constraint-based operators to solve the vehicle routing problem with time windows. J Heuristics 8: 43-58.
    • (2002) J Heuristics , vol.8 , pp. 43-58
    • Rousseau, L.-M.1    Gendreau, M.2    Pesant, G.3
  • 21
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35: 254-265.
    • (1987) Oper Res , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 22
    • 0019636116 scopus 로고
    • Analysis of a preference order traveling salesman problem
    • Sniedovich M (1981) Analysis of a preference order traveling salesman problem. Oper Res 29: 1234-1237.
    • (1981) Oper Res , vol.29 , pp. 1234-1237
    • Sniedovich, M.1
  • 23
    • 3843131812 scopus 로고    scopus 로고
    • The granular tabu search and its application to the vehicle-routing problem
    • Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J Comput 15: 333-346.
    • (2003) INFORMS J Comput , vol.15 , pp. 333-346
    • Toth, P.1    Vigo, D.2

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