메뉴 건너뛰기




Volumn 64, Issue 6, 2013, Pages 925-937

Managing vehicle breakdown incidents during urban distribution of a common product

Author keywords

city logistics; distribution vehicle breakdown; team orienteering problem; urban distribution; vehicle routing

Indexed keywords

GENETIC ALGORITHMS; GEOGRAPHICAL DISTRIBUTION; VEHICLE ROUTING; VEHICLES;

EID: 84877138000     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2012.93     Document Type: Article
Times cited : (12)

References (17)
  • 1
    • 33846106058 scopus 로고    scopus 로고
    • Metaheuristics for the team orienteering problem
    • Archetti C, Hertz A and Speranza M (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics 13(1): 49-76
    • (2007) Journal of Heuristics , vol.13 , Issue.1 , pp. 49-76
    • Archetti, C.1    Hertz, A.2    Speranza, M.3
  • 3
    • 34848923791 scopus 로고    scopus 로고
    • An exact algorithm for team orienteering problems
    • Boussier S, Feillet D and Gendreau M (2007). An exact algorithm for team orienteering problems. 4OR 5(3): 211-230
    • (2007) 4OR , vol.5 , Issue.3 , pp. 211-230
    • Boussier, S.1    Feillet, D.2    Gendreau, M.3
  • 4
    • 0028317478 scopus 로고
    • A heuristic for the multiple tour maximum collection problem
    • Butt S and Cavalier T (1994). A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 21(1): 101-111
    • (1994) Computers and Operations Research , vol.21 , Issue.1 , pp. 101-111
    • Butt, S.1    Cavalier, T.2
  • 7
    • 0002144209 scopus 로고
    • A generalized permanent labeling algorithm for the shortest path problem with time windows
    • Desrochers M and Soumis F (1988). A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26(3): 191-212
    • (1988) INFOR , vol.26 , Issue.3 , pp. 191-212
    • Desrochers, M.1    Soumis, F.2
  • 8
    • 84877146243 scopus 로고    scopus 로고
    • Single vehicle routing with predefined client sequence and multiple warehouse returns: The case of two Warehouses
    • Reference number: DO177
    • Dikas G, Minis I and Mamasis K (2011). Single vehicle routing with predefined client sequence and multiple warehouse returns: The case of two Warehouses. Under review in Discrete Optimization. Reference number: DO177
    • (2011) Under Review in Discrete Optimization
    • Dikas, G.1    Minis, I.2    Mamasis, K.3
  • 10
    • 84908780328 scopus 로고
    • Computer solution of the travelling salesman problem
    • Lin S (1965). Computer solution of the travelling salesman problem. Bell System Technical Journal 44(1): 2245-2269
    • (1965) Bell System Technical Journal , vol.44 , Issue.1 , pp. 2245-2269
    • Lin, S.1
  • 11
    • 84862224340 scopus 로고    scopus 로고
    • Real-Time management of vehicle breakdowns in urban freight distribution
    • Minis I,Mamasis K and Zeimpekis V (2012). Real-Time management of vehicle breakdowns in urban freight distribution. Journal of Heuristics 18(3): 375-400
    • (2012) Journal of Heuristics , vol.18 , Issue.3 , pp. 375-400
    • Minis, I.1    Mamasis, K.2    Zeimpekis, V.3
  • 12
    • 79952373891 scopus 로고    scopus 로고
    • Disruption management of the vehicle routing problem with vehicle breakdown
    • Mu Q, Fu Z, Lysgaard J and Eglese R (2010). Disruption management of the vehicle routing problem with vehicle breakdown. Journal of the Operational Research Society 62(4): 742-749
    • (2010) Journal of the Operational Research Society , vol.62 , Issue.4 , pp. 742-749
    • Mu, Q.1    Fu, Z.2    Lysgaard, J.3    Eglese, R.4
  • 14
    • 9544227386 scopus 로고    scopus 로고
    • A tabu search heuristic for the team orienteering problem
    • Tang andMiller-Hooks (2005). A tabu search heuristic for the team orienteering problem. Computer and Operations Research 32(6): 1379-1407
    • (2005) Computer and Operations Research , vol.32 , Issue.6 , pp. 1379-1407
    • Tang, M.-H.1
  • 15
    • 75449098740 scopus 로고    scopus 로고
    • A genetic algorithm with an adaptive penalty function for the orienteering problem
    • Tasgetiren M (2001). A genetic algorithm with an adaptive penalty function for the orienteering problem. Journal of Economic and Social Research 4(2): 1-26
    • (2001) Journal of Economic and Social Research , vol.4 , Issue.2 , pp. 1-26
    • Tasgetiren, M.1


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