메뉴 건너뛰기




Volumn , Issue , 2012, Pages

A fast approximative approach for the vehicle routing problem

Author keywords

[No Author keywords available]

Indexed keywords

DELIVERY ROUTES; MEMORY-BASED APPROACH; TIME CONSUMPTION; TRAVELLING SALESMAN PROBLEM; VEHICLE ROUTING PROBLEMS;

EID: 84870359510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/UKCI.2012.6335752     Document Type: Conference Paper
Times cited : (5)

References (22)
  • 1
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • [Online]. Available
    • G. B. Dantzig and J. H. Ramser, "The truck dispatching problem," Management Science, vol. 6, no. 1, pp. 80-91, 1959. [Online]. Available: http://www.jstor.org/stable/2627477
    • (1959) Management Science , vol.6 , Issue.1 , pp. 80-91
    • Dantzig, G.B.1    Ramser, J.H.2
  • 2
    • 0003558735 scopus 로고
    • Combinatorial optimization
    • R. Holt and Winston, Eds.
    • E. Lawler, Combinatorial optimization, R. Holt and Winston, Eds. Networks and matroids, 1976.
    • (1976) Networks and Matroids
    • Lawler, E.1
  • 6
    • 0006038590 scopus 로고    scopus 로고
    • V. D. Toth, P., Ed. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
    • G. Laporte and F. Semet, Classical heuristics for the capacitated VRP, V. D. Toth, P., Ed. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2001.
    • (2001) Classical Heuristics for the Capacitated VRP
    • Laporte, G.1    Semet, F.2
  • 7
    • 14844361815 scopus 로고    scopus 로고
    • A variable neighborhood search for the multi depot vehicle routing problem with time windows
    • March
    • M. Polacek, R. F. Hartl, K. Doerner, and M. Reimann, "A variable neighborhood search for the multi depot vehicle routing problem with time windows," Journal of Heuristics, vol. 6, no. 10, pp. 613-627, March 2005.
    • (2005) Journal of Heuristics , vol.6 , Issue.10 , pp. 613-627
    • Polacek, M.1    Hartl, R.F.2    Doerner, K.3    Reimann, M.4
  • 9
    • 0001840045 scopus 로고
    • Exact solution to a location problem with stochastic demands
    • G. Laporte, F. V. Louveaux, and L. Van Hamme, "Exact solution to a location problem with stochastic demands," Transportation science, vol. 28, no. 2, pp. 95-103, 1994.
    • (1994) Transportation Science , vol.28 , Issue.2 , pp. 95-103
    • Laporte, G.1    Louveaux, F.V.2    Van Hamme, L.3
  • 10
    • 0000354875 scopus 로고
    • A multiplier adjustment method for the generalized assignment problem
    • [Online]. Available
    • M. L. Fisher, R. Jaikumar, and L. N. V. Wassenhove, "A multiplier adjustment method for the generalized assignment problem," Management Science, vol. 32, no. 9, pp. 1095-1103, 1986. [Online]. Available: http://www.jstor.org/stable/2631537
    • (1986) Management Science , vol.32 , Issue.9 , pp. 1095-1103
    • Fisher, M.L.1    Jaikumar, R.2    Wassenhove, L.N.V.3
  • 11
    • 77956627085 scopus 로고    scopus 로고
    • What you should know about the vehicle routing problem
    • August [Online]. Available
    • G. Laporte, G. Laporte, and L. C. D. Gerad, "What you should know about the vehicle routing problem," Les Cahiers du GERAD, vol. 59, pp. 1-16, August 2007. [Online]. Available: http://www. scientificcommons.org/ 43541713
    • (2007) Les Cahiers du GERAD , vol.59 , pp. 1-16
    • Laporte, G.1    Laporte, G.2    Gerad, L.C.D.3
  • 15
    • 0000110116 scopus 로고
    • Local search in routing problems with time windows
    • M. Savelsbergh, "Local search in routing problems with time windows," Annals of Operations Research, vol. 4, p. 285305, 1985.
    • (1985) Annals of Operations Research , vol.4 , pp. 285305
    • Savelsbergh, M.1
  • 17
    • 84867946486 scopus 로고    scopus 로고
    • Models, relaxations and exact approaches for the capacitated vehicle routing problem
    • [Online]. Available
    • P. Toth and D. Vigo, "Models, relaxations and exact approaches for the capacitated vehicle routing problem," Discrete Applied Mathematics, vol. 123, no. 1-3, pp. 487-512, 2002. [Online]. Available: http://www. sciencedirect.com/science/article/ B6TYW-44SKCGD-2/2/ 1a8aecfb85c9d2d94a1cb174d2f1904d
    • (2002) Discrete Applied Mathematics , vol.123 , Issue.1-3 , pp. 487-512
    • Toth, P.1    Vigo, D.2
  • 18
    • 77956903750 scopus 로고
    • Exact algorithms for the vehicle routing problem
    • Surveys in Combinatorial Optimization, ser. M. M. Silvano Martello, Gilbert Laporte and C. Ribeiro, Eds. North-Holland, [Online]. Available
    • G. Laporte and Y. Nobert, "Exact algorithms for the vehicle routing problem," in Surveys in Combinatorial Optimization, ser. North- Holland Mathematics Studies, M. M. Silvano Martello, Gilbert Laporte and C. Ribeiro, Eds. North-Holland, 1987, vol. 132, pp. 147-184. [Online]. Available: http://www.sciencedirect.com/science/article/ B8GWT-4SH1BHT-B/2/ 624be798df3a9fbecae2a4a5d57c6f44
    • (1987) North- Holland Mathematics Studies , vol.132 , pp. 147-184
    • Laporte, G.1    Nobert, Y.2


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