메뉴 건너뛰기




Volumn 10, Issue 1, 2012, Pages 34-46

An Analysis of Exact VRPTW Solutions on ITS Data-based Logistics Instances

Author keywords

City logistics; Realistic logistics instances; Soft time windows; Vehicle routing

Indexed keywords

CITY LOGISTICS; COST-EFFICIENT; ENVIRONMENTAL ISSUES; EXACT SOLUTION; IDLING TIME; NUMBER OF VEHICLES; REALISTIC LOGISTICS INSTANCES; SOFT TIME WINDOWS; TIME WINDOWS; VEHICLE INFORMATION AND COMMUNICATION SYSTEMS; VEHICLE ROUTING AND SCHEDULING;

EID: 84855675619     PISSN: None     EISSN: 18688659     Source Type: Journal    
DOI: 10.1007/s13177-011-0040-2     Document Type: Article
Times cited : (8)

References (33)
  • 2
    • 0242315305 scopus 로고    scopus 로고
    • City logistics and freight transport
    • A. M. Brewer, K. J. Button, and D. A. Hensher (Eds.), Oxford: Pergamon
    • Thompson, R. G., Taniguchi, E.: City logistics and freight transport. In: Brewer, A. M., Button, K. J., Hensher, D. A. (eds.) Handbook of Logistics and Supply-Chain Management, pp. 393-405. Pergamon, Oxford (2001).
    • (2001) Handbook of Logistics and Supply-Chain Management , pp. 393-405
    • Thompson, R.G.1    Taniguchi, E.2
  • 3
    • 34548790636 scopus 로고    scopus 로고
    • Real time simulation of auctioning and re-scheduling process in hybrid freight markets
    • van JHR, Duin, Tavasszy, L. A., Taniguchi, E.: Real time simulation of auctioning and re-scheduling process in hybrid freight markets. Transportation Research Part B 41, 1050-1066 (2007).
    • (2007) Transportation Research Part B , vol.41 , pp. 1050-1066
    • van Jhr, D.1    Tavasszy, L.A.2    Taniguchi, E.3
  • 4
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problem with time windows constraints
    • Solomon, M. M.: Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper. Res. 35(2), 254-265 (1987).
    • (1987) Oper. Res. , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.M.1
  • 5
    • 77956635786 scopus 로고    scopus 로고
    • Vehicle routing and scheduling, in innovations
    • E. Taniguchi and R. G. Thompson (Eds.), Southampton: WIT Press
    • Thompson, R. G., van Duin, J. H. R.: Vehicle routing and scheduling. In: Taniguchi, E., Thompson, R. G. (eds.) Innovations in Freight Transport, pp. 47-63. WIT Press, Southampton (2003).
    • (2003) Freight Transportation , pp. 47-63
    • Thompson, R.G.1    van Duin, J.H.R.2
  • 6
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • Taillard, E., Badeau, P., Guertin, F., Gendreau, M., Potvin, J.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170-186 (1997).
    • (1997) Transp. Sci. , vol.31 , pp. 170-186
    • Taillard, E.1    Badeau, P.2    Guertin, F.3    Gendreau, M.4    Potvin, J.5
  • 7
    • 0033224837 scopus 로고    scopus 로고
    • Parallel tabu search for real-time vehicle and dispatching
    • Gendreau, M., Guertin, F., Potvin, J., Taillard, E.: Parallel tabu search for real-time vehicle and dispatching. Transp. Sci. 33, 381-390 (1999).
    • (1999) Transp. Sci. , vol.33 , pp. 381-390
    • Gendreau, M.1    Guertin, F.2    Potvin, J.3    Taillard, E.4
  • 9
    • 69249215535 scopus 로고    scopus 로고
    • Analysis of the effects of cooperative delivery system in Bangkok
    • E. Taniguchi and R. G. Thompson (Eds.), Oxford: Elsevier
    • Qureshi, A., Hanaoka, S.: Analysis of the effects of cooperative delivery system in Bangkok. In: Taniguchi, E., Thompson, R. G. (eds.) Recent Advances in City Logistics, pp. 59-73. Elsevier, Oxford (2005).
    • (2005) Recent Advances in City Logistics , pp. 59-73
    • Qureshi, A.1    Hanaoka, S.2
  • 10
    • 0242378280 scopus 로고    scopus 로고
    • Co-operative vehicle routing model with optimal location of logistics terminals
    • E. Taniguchi and R. G. Thompson (Eds.), Japan: Institute for City Logistics
    • Yamada, T., Taniguchi, E., Itoh, Y.: Co-operative vehicle routing model with optimal location of logistics terminals. In: Taniguchi, E., Thompson, R. G. (eds.) City Logistics II, pp. 139-153. Institute for City Logistics, Japan (2001).
    • (2001) City Logistics II , pp. 139-153
    • Yamada, T.1    Taniguchi, E.2    Itoh, Y.3
  • 12
    • 26444602999 scopus 로고    scopus 로고
    • Lagrangian duality applied to the vehicle routing problem with time windows
    • Kallehauge, B., Larsen, J., Madsen, O. B. G.: Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33, 1464-1487 (2006).
    • (2006) Comput. Oper. Res. , vol.33 , pp. 1464-1487
    • Kallehauge, B.1    Larsen, J.2    Madsen, O.B.G.3
  • 13
    • 0031140531 scopus 로고    scopus 로고
    • An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation
    • Kohl, N., Madsen, O. B. G.: An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Oper. Res. 45, 395-406 (1997).
    • (1997) Oper. Res. , vol.45 , pp. 395-406
    • Kohl, N.1    Madsen, O.B.G.2
  • 14
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342-354 (1992).
    • (1992) Oper. Res. , vol.40 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 15
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems
    • Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks, 216-229 (2004).
    • (2004) Networks , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 16
    • 32044469861 scopus 로고    scopus 로고
    • Vehicle routing problem with elementary shortest path based column generation
    • Chabrier, A.: Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33, 2972-2990 (2006).
    • (2006) Comput. Oper. Res. , vol.33 , pp. 2972-2990
    • Chabrier, A.1
  • 17
    • 33746329306 scopus 로고    scopus 로고
    • Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
    • Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3, 255-273 (2006).
    • (2006) Discret. Optim. , vol.3 , pp. 255-273
    • Righini, G.1    Salani, M.2
  • 19
    • 0037774775 scopus 로고    scopus 로고
    • A business-to-business fleet management service provider for central food market enterprises
    • Prindezis, N., Kiranoudis, C. T., Marinos-Kouris, D.: A business-to-business fleet management service provider for central food market enterprises. J. Food Eng. 60, 203-210 (2003).
    • (2003) J. Food Eng. , vol.60 , pp. 203-210
    • Prindezis, N.1    Kiranoudis, C.T.2    Marinos-Kouris, D.3
  • 20
    • 0036682459 scopus 로고    scopus 로고
    • A GIS-based decision support system for intra-city vehicle routing with time windows
    • Ioannoue, G., Kritikos, M. N., Prastacos, G. P.: A GIS-based decision support system for intra-city vehicle routing with time windows. J. Oper. Res. Soc. 53, 842-854 (2002).
    • (2002) J. Oper. Res. Soc. , vol.53 , pp. 842-854
    • Ioannoue, G.1    Kritikos, M.N.2    Prastacos, G.P.3
  • 21
    • 3042529730 scopus 로고    scopus 로고
    • Time-varying travel times in vehicle routing
    • Fleischmann, B., Gietz, M., Gnutzmann, S.: Time-varying travel times in vehicle routing. Transp. Sci. 38, 160-173 (2004).
    • (2004) Transp. Sci. , vol.38 , pp. 160-173
    • Fleischmann, B.1    Gietz, M.2    Gnutzmann, S.3
  • 22
    • 67650813015 scopus 로고    scopus 로고
    • Prediction of travel time in urban district based on state equation
    • Hiramatsu, A., Nose, K., Tenmoku, K., Morita, T.: Prediction of travel time in urban district based on state equation. Electron. Comm. Jpn. 92, 1-11 (2009).
    • (2009) Electron. Comm. Jpn. , vol.92 , pp. 1-11
    • Hiramatsu, A.1    Nose, K.2    Tenmoku, K.3    Morita, T.4
  • 23
    • 33748176011 scopus 로고    scopus 로고
    • Travel time reliability in vehicle routing and scheduling with time windows
    • Ando, N., Taniguchi, E.: Travel time reliability in vehicle routing and scheduling with time windows. Networks Spatial Econ. 6, 293-311 (2006).
    • (2006) Networks Spatial Econ. , vol.6 , pp. 293-311
    • Ando, N.1    Taniguchi, E.2
  • 24
    • 33748591592 scopus 로고    scopus 로고
    • The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3
    • Irnich, S., Villeneuve, D.: The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. Informs 18, 391-406 (2006).
    • (2006) Informs , vol.18 , pp. 391-406
    • Irnich, S.1    Villeneuve, D.2
  • 25
    • 0002144209 scopus 로고    scopus 로고
    • A generalized permanent labeling algorithm for shortest path problem with time windows
    • Desrochers, M., Soumis, F.: A generalized permanent labeling algorithm for shortest path problem with time windows. Infor 26, 191-212 (1998).
    • (1998) Infor , vol.26 , pp. 191-212
    • Desrochers, M.1    Soumis, F.2
  • 26
    • 3342959729 scopus 로고    scopus 로고
    • PhD. Thesis No. 62, Department of Mathematical Modeling (IMM) at the Technical University of Denmark (DTU)
    • Larsen, J.: Parallelization of the Vehicle Routing Problem with Time Windows. PhD. Thesis No. 62, Department of Mathematical Modeling (IMM) at the Technical University of Denmark (DTU) (1999).
    • (1999) Parallelization of the Vehicle Routing Problem with Time Windows
    • Larsen, J.1
  • 27
    • 69249232196 scopus 로고    scopus 로고
    • An exact solution approach for vehicle routing and scheduling problems with soft time windows
    • Qureshi, A. G., Taniguchi, E., Yamada, T.: An exact solution approach for vehicle routing and scheduling problems with soft time windows. Transport. Res. Part E 45, 960-977 (2009).
    • (2009) Transport. Res. Part E , vol.45 , pp. 960-977
    • Qureshi, A.G.1    Taniguchi, E.2    Yamada, T.3
  • 28
    • 0030262735 scopus 로고    scopus 로고
    • The strategy and deployment plan for VICS
    • Yamada, S.: The strategy and deployment plan for VICS. IEEE Comm. Mag. 34, 94-97 (1996).
    • (1996) IEEE Comm. Mag. , vol.34 , pp. 94-97
    • Yamada, S.1
  • 29
    • 84855711923 scopus 로고    scopus 로고
    • accessed on date 15-04 Ministry of Land, Infrastructure and Transportation (MLIT) web site
    • Ministry of Land, Infrastructure and Transportation (MLIT) web site, http://www. mlit. go. jp/road/ITS/topindex/topindex_g03_3. html, accessed on date 15-04-2010.
    • (2010)
  • 30
    • 84855671024 scopus 로고    scopus 로고
    • accessed on date 16-01 Japan, Highway Industry Development Organization (HIDO), available online at
    • ITS Handbook 2007-2008, Japan, Highway Industry Development Organization (HIDO), available online at, http://www. hido. or. jp/09kankou/HANDBOOK_all. pdf, accessed on date 16-01-2010.
    • (2010) ITS Handbook 2007-2008


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