메뉴 건너뛰기




Volumn 18, Issue 3, 2012, Pages 375-400

Real-time management of vehicle breakdowns in urban freight distribution

Author keywords

City logistics; Distribution vehicle breakdown; Freight distribution; Team orienteering problem; Vehicle routing

Indexed keywords

CITY LOGISTICS; COMPUTATIONAL TIME; DISTRIBUTION FLEET; DISTRIBUTION VEHICLES; EFFECTIVE SOLUTION; FLEET MANAGEMENT SYSTEM; FREIGHT DISTRIBUTION; HIGH QUALITY; LIMITED CAPACITY; ORIENTEERING PROBLEM; REAL TIME; REAL-TIME MANAGEMENT; UNEXPECTED EVENTS; URBAN FREIGHT DISTRIBUTION;

EID: 84862224340     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9191-1     Document Type: Review
Times cited : (11)

References (25)
  • 1
    • 33846106058 scopus 로고    scopus 로고
    • Metaheuristics for the team orienteering problem
    • DOI 10.1007/s10732-006-9004-0
    • C. Archetti A. Hertz M. Speranza 2007 Metaheuristics for the team orienteering problem J. Heuristics 13 1 49 76 10.1007/s10732-006-9004-0 (Pubitemid 46067452)
    • (2007) Journal of Heuristics , vol.13 , Issue.1 , pp. 49-76
    • Archetti, C.1    Hertz, A.2    Speranza, M.G.3
  • 2
    • 67449149289 scopus 로고    scopus 로고
    • The capacitated team orienteering and profitable tour problems
    • 1171.90344 10.1057/palgrave.jors.2602603
    • C. Archetti D. Feillet A. Hertz M. Speranza 2009 The capacitated team orienteering and profitable tour problems J. Oper. Res. Soc. 60 6 831 842 1171.90344 10.1057/palgrave.jors.2602603
    • (2009) J. Oper. Res. Soc. , vol.60 , Issue.6 , pp. 831-842
    • Archetti, C.1    Feillet, D.2    Hertz, A.3    Speranza, M.4
  • 3
    • 34848923791 scopus 로고    scopus 로고
    • An exact algorithm for team orienteering problems
    • 2353416 1211.90029 10.1007/s10288-006-0009-1
    • S. Boussier D. Feillet M. Gendreau 2007 An exact algorithm for team orienteering problems 4OR 5 3 211 230 2353416 1211.90029 10.1007/s10288-006- 0009-1
    • (2007) 4OR , vol.5 , Issue.3 , pp. 211-230
    • Boussier, S.1    Feillet, D.2    Gendreau, M.3
  • 4
    • 3843089807 scopus 로고    scopus 로고
    • A new hybrid evolutionary algorithm for the vehicle routing problem with time windows
    • Skodsborg, Denmark
    • Bräysy, O., Berger, J., Barkaoui, M.: A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. In: Proceedings of Route 2000 Workshop, Skodsborg, Denmark (2000)
    • (2000) Proceedings of Route 2000 Workshop
    • Bräysy, O.1    Berger, J.2    Barkaoui, M.3
  • 5
    • 0028317478 scopus 로고
    • A heuristic for the multiple tour maximum collection problem
    • 0789.90081 10.1016/0305-0548(94)90065-5
    • S. Butt T. Cavalier 1994 A heuristic for the multiple tour maximum collection problem Comput. Oper. Res. 21 11 101 123 0789.90081 10.1016/0305-0548(94)90065-5
    • (1994) Comput. Oper. Res. , vol.21 , Issue.11 , pp. 101-123
    • Butt, S.1    Cavalier, T.2
  • 6
    • 0032764836 scopus 로고    scopus 로고
    • An optimal solution procedure for the multiple tour maximum collection problem using column generation
    • DOI 10.1016/S0305-0548(98)00071-9, PII S0305054898000719
    • S. Butt D. Ryan 1999 An optimal solution procedure for the multiple tour maximum collection problem using column generation Comput. Oper. Res. 26 4 427 441 1678298 0951.90007 10.1016/S0305-0548(98)00071-9 (Pubitemid 29346470)
    • (1999) Computers and Operations Research , vol.26 , Issue.4 , pp. 427-441
    • Butt, S.E.1    Ryan, D.M.2
  • 8
    • 0030574676 scopus 로고    scopus 로고
    • A fast and effective heuristic for the orienteering problem
    • DOI 10.1016/0377-2217(95)00035-6
    • I. Chao B. Golden E. Wasil 1996 A fast and effective heuristic for the orienteering problem Eur. J. Oper. Res. 88 3 475 489 0911.90146 10.1016/0377-2217(95)00035-6 (Pubitemid 126368049)
    • (1996) European Journal of Operational Research , vol.88 , Issue.3 , pp. 475-489
    • Chao, I.-M.1    Golden, B.L.2    Wasil, E.A.3
  • 9
    • 0041779433 scopus 로고    scopus 로고
    • Solving general ring network design problems by meta-heuristics
    • M. Laguna J.L. Gonzalez Velarde (eds). Kluwer Academic Boston. 10.1007/978-1-4615-4567-5-5
    • Fink, A., Schneidereit, G., Vo, S.: Solving general ring network design problems by meta-heuristics. In: Laguna, M., Gonzalez Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation, pp. 91-113. Kluwer Academic, Boston (2000)
    • (2000) Computing Tools for Modeling, Optimization and Simulation , pp. 91-113
    • Fink, A.1    Schneidereit, G.2    Vo, S.3
  • 10
    • 84989741976 scopus 로고
    • The orienteering problem
    • 0647.90099 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3. 0.CO;2-D
    • B. Golden L. Levy R. Vohra 1987 The orienteering problem Nav. Res. Logist. 34 3 307 318 0647.90099 10.1002/1520-6750(198706)34:3<307::AID- NAV3220340302>3.0.CO;2-D
    • (1987) Nav. Res. Logist. , vol.34 , Issue.3 , pp. 307-318
    • Golden, B.1    Levy, L.2    Vohra, R.3
  • 11
    • 38849090016 scopus 로고    scopus 로고
    • Ants can solve the team orienteering problem
    • DOI 10.1016/j.cie.2007.10.001, PII S0360835207002161
    • L. Ke C. Archetti Z. Feng 2008 Ants can solve the team orienteering problem Comput. Ind. Eng. 54 3 648 665 10.1016/j.cie.2007.10.001 (Pubitemid 351199811)
    • (2008) Computers and Industrial Engineering , vol.54 , Issue.3 , pp. 648-665
    • Ke, L.1    Archetti, C.2    Feng, Z.3
  • 12
    • 79953192209 scopus 로고    scopus 로고
    • The bus bridging problem in metro operations: Conceptual framework, models and algorithms
    • 10.1007/s12469-010-0017-6
    • K. Kepaptsoglou M.G. Karlaftis 2010 The bus bridging problem in metro operations: conceptual framework, models and algorithms Public Transp. 1 4 275 297 10.1007/s12469-010-0017-6
    • (2010) Public Transp. , vol.1 , Issue.4 , pp. 275-297
    • Kepaptsoglou, K.1    Karlaftis, M.G.2
  • 13
    • 55149123359 scopus 로고    scopus 로고
    • Real-time vehicle rerouting problems with time windows
    • 2472581 1168.90362 10.1016/j.ejor.2007.12.037
    • J.-Q. Li P.B. Mirchandani D. Borenstein 2009 Real-time vehicle rerouting problems with time windows Eur. J. Oper. Res. 194 3 711 727 2472581 1168.90362 10.1016/j.ejor.2007.12.037
    • (2009) Eur. J. Oper. Res. , vol.194 , Issue.3 , pp. 711-727
    • Li, J.-Q.1    Mirchandani, P.B.2    Borenstein, D.3
  • 14
    • 84908780328 scopus 로고
    • Computer solution of the travelling salesman problem
    • 0136.14705
    • S. Lin 1965 Computer solution of the travelling salesman problem Bell Syst. Tech. J. 44 1 2245 2269 0136.14705
    • (1965) Bell Syst. Tech. J. , vol.44 , Issue.1 , pp. 2245-2269
    • Lin, S.1
  • 15
    • 79952373891 scopus 로고    scopus 로고
    • Disruption management of the vehicle routing problem with vehicle breakdown
    • 10.1057/jors.2010.19
    • Q. Mu Z. Fu J. Lysgaard R. Eglese 2010 Disruption management of the vehicle routing problem with vehicle breakdown J. Oper. Res. Soc. 10.1057/jors.2010.19
    • (2010) J. Oper. Res. Soc.
    • Mu, Q.1    Fu, Z.2    Lysgaard, J.3    Eglese, R.4
  • 16
    • 21844525941 scopus 로고
    • Dynamic vehicle routing: Status and prospects
    • H.N. Psaraftis 1995 Dynamic vehicle routing: status and prospects Ann. Oper. Res. 61 1 143 164 0839.90037 10.1007/BF02098286 (Pubitemid 126016685)
    • (1995) Annals of Operations Research , vol.61 , pp. 143-164
    • Psaraftis, H.N.1
  • 17
    • 0042844030 scopus 로고
    • Using tabu search for solving a dynamic multi-terminal truck dispatching problem
    • 0904.90053 10.1016/0377-2217(95)00016-J
    • C. Rego C. Roucairol 1995 Using tabu search for solving a dynamic multi-terminal truck dispatching problem Eur. J. Oper. Res. 83 2 411 429 0904.90053 10.1016/0377-2217(95)00016-J
    • (1995) Eur. J. Oper. Res. , vol.83 , Issue.2 , pp. 411-429
    • Rego, C.1    Roucairol, C.2
  • 18
    • 0032119456 scopus 로고    scopus 로고
    • Drive: Dynamic routing of independent vehicles
    • M.W.P. Savelsbergh M. Sol 1998 Drive: dynamic routing of independent vehicles Oper. Res. 46 4 474 490 0987.90511 10.1287/opre.46.4.474 (Pubitemid 128665758)
    • (1998) Operations Research , vol.46 , Issue.4 , pp. 474-490
    • Savelsbergh, M.1    Sol, M.2
  • 19
    • 0022731384 scopus 로고
    • Algorithms for the vehicle routing and scheduling problem with time window constraints
    • 10.1002/net.3230160205
    • M.M. Solomon 1987 Algorithms for the vehicle routing and scheduling problem with time window constraints Networks 16 161 167 10.1002/net.3230160205
    • (1987) Networks , vol.16 , pp. 161-167
    • Solomon, M.M.1
  • 20
    • 77951143275 scopus 로고    scopus 로고
    • A path relinking approach for the team orienteering problem
    • 2638902 1188.90221 10.1016/j.cor.2009.05.002
    • W. Souffriau P. Vansteenwegen G. Vanden Berghe D. Van Oudheusden 2010 A path relinking approach for the team orienteering problem Comput. Oper. Res. 37 11 1853 1859 2638902 1188.90221 10.1016/j.cor.2009.05.002
    • (2010) Comput. Oper. Res. , vol.37 , Issue.11 , pp. 1853-1859
    • Souffriau, W.1    Vansteenwegen, P.2    Vanden Berghe, G.3    Van Oudheusden, D.4
  • 21
    • 9544227386 scopus 로고    scopus 로고
    • A tabu search heuristic for the team orienteering problem
    • 10.1016/j.cor.2003.11.008
    • H. Tang E. Miller-Hooks 2005 A tabu search heuristic for the team orienteering problem Comput. Oper. Res. 32 6 1379 1407 10.1016/j.cor.2003.11.008
    • (2005) Comput. Oper. Res. , vol.32 , Issue.6 , pp. 1379-1407
    • Tang, H.1    Miller-Hooks, E.2
  • 22
    • 75449098740 scopus 로고    scopus 로고
    • A genetic algorithm with an adaptive penalty function for the orienteering problem
    • M. Tasgetiren 2001 A genetic algorithm with an adaptive penalty function for the orienteering problem J. Econ. Soc. Res. 4 2 1 26
    • (2001) J. Econ. Soc. Res. , vol.4 , Issue.2 , pp. 1-26
    • Tasgetiren, M.1
  • 23
    • 84974863294 scopus 로고
    • Heuristic methods applied to orienteering
    • T. Tsiligirides 1984 Heuristic methods applied to orienteering J. Oper. Res. Soc. 35 9 797 809
    • (1984) J. Oper. Res. Soc. , vol.35 , Issue.9 , pp. 797-809
    • Tsiligirides, T.1
  • 24
    • 36049028288 scopus 로고    scopus 로고
    • Single vehicle routing with a predefined customer sequence and multiple depot returns
    • DOI 10.1016/j.ejor.2007.03.017, PII S0377221707003566
    • P. Tsirimpas A. Tatarakis I. Minis E.G. Kyriakidis 2008 Single vehicle routing with a predefined customer sequence and multiple depot returns Eur. J. Oper. Res. 187 2 483 495 2370299 1149.90024 10.1016/j.ejor.2007.03.017 (Pubitemid 350102860)
    • (2008) European Journal of Operational Research , vol.187 , Issue.2 , pp. 483-495
    • Tsirimpas, P.1    Tatarakis, A.2    Minis, I.3    Kyriakidis, E.G.4
  • 25
    • 56549084034 scopus 로고    scopus 로고
    • A guided local search metaheuristic for the team orienteering problem
    • 1156.90417 10.1016/j.ejor.2008.02.037
    • P. Vansteenwegen W. Souffriau G. Vanden Berghe D. Van Oudheusden 2009 A guided local search metaheuristic for the team orienteering problem Eur. J. Oper. Res. 196 1 118 127 1156.90417 10.1016/j.ejor.2008.02.037
    • (2009) Eur. J. Oper. Res. , vol.196 , Issue.1 , pp. 118-127
    • Vansteenwegen, P.1    Souffriau, W.2    Vanden Berghe, G.3    Van Oudheusden, D.4


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