메뉴 건너뛰기




Volumn 37, Issue 1, 2009, Pages 37-42

A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

Author keywords

Time window; Time dependent costs; Vehicle Routing

Indexed keywords

NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLES; WINDOWS;

EID: 58049120113     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.07.007     Document Type: Article
Times cited : (48)

References (18)
  • 1
    • 40849094266 scopus 로고    scopus 로고
    • An Asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation
    • Albiach J., Sanchis J.M., and Soler D. An Asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. European J. Oper. Res. 189 (2008) 789-802
    • (2008) European J. Oper. Res. , vol.189 , pp. 789-802
    • Albiach, J.1    Sanchis, J.M.2    Soler, D.3
  • 2
    • 33749651515 scopus 로고    scopus 로고
    • A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
    • Avarenga G.B., Mateus G.R., and de Tomi G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34 (2007) 1561-1584
    • (2007) Comput. Oper. Res. , vol.34 , pp. 1561-1584
    • Avarenga, G.B.1    Mateus, G.R.2    de Tomi, G.3
  • 3
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part I: Route construction and local search algorithms
    • Bräysy O., and Gendreau M. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transp. Sci. 39 (2005) 104-118
    • (2005) Transp. Sci. , vol.39 , pp. 104-118
    • Bräysy, O.1    Gendreau, M.2
  • 4
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part II: Metaheuristics
    • Bräysy O., and Gendreau M. Vehicle routing problem with time windows, Part II: Metaheuristics. Transp. Sci. 39 (2005) 119-139
    • (2005) Transp. Sci. , vol.39 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 5
    • 33746545163 scopus 로고    scopus 로고
    • The real-time time-dependent vehicle routing problem
    • Chen H.K., Hsueh C.F., and Chang M.S. The real-time time-dependent vehicle routing problem. Transp. Res. Part E 42 (2006) 383-408
    • (2006) Transp. Res. Part E , vol.42 , pp. 383-408
    • Chen, H.K.1    Hsueh, C.F.2    Chang, M.S.3
  • 7
    • 29044449517 scopus 로고    scopus 로고
    • A new ILP-based refinement heuristic for vehicle routing problems
    • De Franceschi R., Fischetti M., and Toth P. A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. Ser. B 105 (2006) 471-499
    • (2006) Math. Program. Ser. B , vol.105 , pp. 471-499
    • De Franceschi, R.1    Fischetti, M.2    Toth, P.3
  • 9
    • 0028508261 scopus 로고
    • A branch-and bound algorithm for the capacitated vehicle routing problem on directed graphs
    • Fischetti M., Toth P., and Vigo D. A branch-and bound algorithm for the capacitated vehicle routing problem on directed graphs. Oper. Res. 42 (1994) 626-642
    • (1994) Oper. Res. , vol.42 , pp. 626-642
    • Fischetti, M.1    Toth, P.2    Vigo, D.3
  • 10
    • 3042529730 scopus 로고    scopus 로고
    • Time-varying travel times in vehicle routing
    • Fleischmann B., Gietz M., and Gnutzmann S. Time-varying travel times in vehicle routing. Transp. Sci. 38 (2004) 160-173
    • (2004) Transp. Sci. , vol.38 , pp. 160-173
    • Fleischmann, B.1    Gietz, M.2    Gnutzmann, S.3
  • 11
    • 0033887939 scopus 로고    scopus 로고
    • An efficient transformation of the generalized vehicle routing problem
    • Ghiani G., and Improta G. An efficient transformation of the generalized vehicle routing problem. European J. Oper. Res. 122 (2000) 11-17
    • (2000) European J. Oper. Res. , vol.122 , pp. 11-17
    • Ghiani, G.1    Improta, G.2
  • 12
    • 0037448282 scopus 로고    scopus 로고
    • Vehicle dispatching with time-dependent travel times
    • Ichoua S., Gendreau M., and Potvin J.Y. Vehicle dispatching with time-dependent travel times. European J. Oper. Res. 144 (2003) 379-396
    • (2003) European J. Oper. Res. , vol.144 , pp. 379-396
    • Ichoua, S.1    Gendreau, M.2    Potvin, J.Y.3
  • 13
    • 13844276135 scopus 로고    scopus 로고
    • A dynamic vehicle routing problem with time-dependent travel times
    • Haghani A., and Jung S. A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32 (2005) 2959-2986
    • (2005) Comput. Oper. Res. , vol.32 , pp. 2959-2986
    • Haghani, A.1    Jung, S.2
  • 14
    • 0022678438 scopus 로고
    • An exact algorithm for the asymmetrical capacitated vehicle-routing problem
    • Laporte G., Mercure H., and Nobert Y. An exact algorithm for the asymmetrical capacitated vehicle-routing problem. Networks 16 (1986) 33-46
    • (1986) Networks , vol.16 , pp. 33-46
    • Laporte, G.1    Mercure, H.2    Nobert, Y.3
  • 15
    • 0002037506 scopus 로고
    • An efficient transformation of the generalized traveling salesman problem
    • Noon C.E., and Bean J.C. An efficient transformation of the generalized traveling salesman problem. INFOR 31 (1993) 39-44
    • (1993) INFOR , vol.31 , pp. 39-44
    • Noon, C.E.1    Bean, J.C.2
  • 16
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34 (2007) 2403-2435
    • (2007) Comput. Oper. Res. , vol.34 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 17
    • 27144536576 scopus 로고    scopus 로고
    • Vehicle routing and scheduling with dynamic travel times
    • Potvin J.Y., Xu Y., and Benyahia I. Vehicle routing and scheduling with dynamic travel times. Comput. Oper. Res. 33 (2006) 1129-1137
    • (2006) Comput. Oper. Res. , vol.33 , pp. 1129-1137
    • Potvin, J.Y.1    Xu, Y.2    Benyahia, I.3
  • 18
    • 0042128680 scopus 로고    scopus 로고
    • A heuristic algorithm for the asymmetric capacitated vehicle routing problem
    • Vigo D. A heuristic algorithm for the asymmetric capacitated vehicle routing problem. European J. Oper. Res. 89 (1996) 108-126
    • (1996) European J. Oper. Res. , vol.89 , pp. 108-126
    • Vigo, D.1


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