메뉴 건너뛰기




Volumn 36, Issue 3 PART 2, 2009, Pages 5987-5991

Time Petri nets as an evaluation tool for handling travel time uncertainty in vehicle routing solutions

Author keywords

Time Petri nets; Time windows; Vehicle routing

Indexed keywords

CONTRACTS; HEURISTIC METHODS; OPERATIONS RESEARCH; PETRI NETS; SALES; SCHEDULING; TRAFFIC CONGESTION; VEHICLE ROUTING; VEHICLES;

EID: 58349106633     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2008.07.001     Document Type: Article
Times cited : (14)

References (15)
  • 1
    • 0020904451 scopus 로고
    • An enumerative approach for analyzing Time Petri Nets
    • Mason R.E.A. (Ed), North Holland
    • Berthomieu B., and Menasche M. An enumerative approach for analyzing Time Petri Nets. In: Mason R.E.A. (Ed). Information processing Vol. 83 (1983), North Holland 41-46
    • (1983) Information processing , vol.83 , pp. 41-46
    • Berthomieu, B.1    Menasche, M.2
  • 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. Transportation Science 39 1 (2005) 104-118
    • (2005) Transportation Science , vol.39 , Issue.1 , 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. Transportation Science 39 1 (2005) 119-139
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 5
    • 3342936647 scopus 로고    scopus 로고
    • A multi-start local search algorithm for the vehicle routing problem with time windows
    • Bräysy O., Hasle G., and Dullaert W. A multi-start local search algorithm for the vehicle routing problem with time windows. European Journal of Operational Research 159 (2004) 586-605
    • (2004) European Journal of Operational Research , vol.159 , pp. 586-605
    • Bräysy, O.1    Hasle, G.2    Dullaert, W.3
  • 6
    • 21344463824 scopus 로고    scopus 로고
    • Simulated annealing metaheuristics for the vehicle routing problem with time windows
    • Chiang W.-C., and Russell R.A. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research 63 (1996) 3-27
    • (1996) Annals of Operations Research , vol.63 , pp. 3-27
    • Chiang, W.-C.1    Russell, R.A.2
  • 7
    • 0001177651 scopus 로고    scopus 로고
    • A reactive tabu search metaheuristic for the vehicle routing problem with time windows
    • Chiang W.-C., and Russell R.A. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing 9 (1997) 417-430
    • (1997) INFORMS Journal on Computing , vol.9 , pp. 417-430
    • Chiang, W.-C.1    Russell, R.A.2
  • 8
    • 77957089136 scopus 로고    scopus 로고
    • Desrosiers, Y., Dumas, Y., Solomon, M. M., & Sopumis, F. (1995). Time constrained routing and scheduling. In: M.O. Ball, T.L. Magnanti, C.L. Monma, & G.L. Nemhauser (Eds.), Network routing: Handbooks in operations research and management science (Vol. 8, pp. 35-139). Amsterdam: North-Holland.
    • Desrosiers, Y., Dumas, Y., Solomon, M. M., & Sopumis, F. (1995). Time constrained routing and scheduling. In: M.O. Ball, T.L. Magnanti, C.L. Monma, & G.L. Nemhauser (Eds.), Network routing: Handbooks in operations research and management science (Vol. 8, pp. 35-139). Amsterdam: North-Holland.
  • 10
    • 12944272148 scopus 로고    scopus 로고
    • Two evolutionary metaheuristics for the vehicle routing problem with time windows
    • Homberger S., and Gehring H. Two evolutionary metaheuristics for the vehicle routing problem with time windows. Infor 37 (1999) 297-318
    • (1999) Infor , vol.37 , pp. 297-318
    • Homberger, S.1    Gehring, H.2
  • 11
    • 0026900954 scopus 로고
    • The vehicle routing problem with stochastic travel times
    • Laporte G., Louveaux F.V., and Mercure H. The vehicle routing problem with stochastic travel times. Transportation Science 26 (1992) 161-170
    • (1992) Transportation Science , vol.26 , pp. 161-170
    • Laporte, G.1    Louveaux, F.V.2    Mercure, H.3
  • 12
    • 0017001923 scopus 로고
    • Recoverability of communication protocols - Implications of a theoretical study
    • Merlin P.M., and Farber D.J. Recoverability of communication protocols - Implications of a theoretical study. IEEE Transactions on Communications, COM-24 (1976) 1036-1043
    • (1976) IEEE Transactions on Communications, COM-24 , pp. 1036-1043
    • Merlin, P.M.1    Farber, D.J.2
  • 13
    • 0002600091 scopus 로고
    • The general pickup and delivery problem
    • Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 1 (1995) 17-29
    • (1995) Transportation Science , vol.29 , Issue.1 , pp. 17-29
    • Savelsbergh, M.W.P.1    Sol, M.2
  • 14
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 2 (1997) 170-186
    • (1997) Transportation Science , vol.31 , Issue.2 , pp. 170-186
    • Taillard, E.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.5


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