메뉴 건너뛰기
Computers and Operations Research
Volumn 31, Issue 4, 2004, Pages 499-513
Finding the first K shortest paths in a time-window network
Author keywords

Network; Shortest path; Simple path; Time window constraint
Indexed keywords

ALGORITHMS; NEURAL NETWORKS; OPTIMAL SYSTEMS;
EID: 0347900476     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00230-7     Document Type: Article
Times cited : (33)
References (15)
  • 1
    • 0034067577 scopus 로고    scopus 로고
    • Shortest paths in traffic-light networks
    • Chen YL, Yang HH. Shortest paths in traffic-light networks. Transportation Research B 2000;34:241-53.
    • (2000) Transportation Research B , vol.34 , pp. 241-253
    • Chen, Y.L.1    Yang, H.H.2
  • 5
    • 0023964259 scopus 로고
    • Time window constrained routing and scheduling problems: A survey
    • Solomon M, Desrosiers J. Time window constrained routing and scheduling problems: a survey. Transactions of Science 1988;22:1-13.
    • (1988) Transactions of Science , vol.22 , pp. 1-13
    • Solomon, M.1    Desrosiers, J.2
  • 6
    • 0027558256 scopus 로고
    • Simple heuristics for the vehicle routing problem with soft time windows
    • Balakrishnan N. Simple heuristics for the vehicle routing problem with soft time windows. JORS 1993;44:279-87.
    • (1993) JORS , vol.44 , pp. 279-287
    • Balakrishnan, N.1
  • 7
    • 0030135117 scopus 로고    scopus 로고
    • Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows
    • Bramel J, Simchilevi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Operations Research 1996;44:501-9.
    • (1996) Operations Research , vol.44 , pp. 501-509
    • Bramel, J.1    Simchilevi, D.2
  • 9
    • 0001407513 scopus 로고    scopus 로고
    • Hybrid heuristics for the vehicle-routing problem with time windows
    • Russell RA. Hybrid heuristics for the vehicle-routing problem with time windows. Transactions of Science 1996;29:156-66.
    • (1996) Transactions of Science , vol.29 , pp. 156-166
    • Russell, R.A.1
  • 10
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • Yen JY. Finding the k shortest loopless paths in a network. Management Science 1971;17:712-16.
    • (1971) Management Science , vol.17 , pp. 712-716
    • Yen, J.Y.1
  • 11
    • 0020292250 scopus 로고
    • An efficient algorithm for k shortest simple paths
    • Katoh N, Ibaraki T, Mine H. An efficient algorithm for k shortest simple paths. Networks 1982;12:411-27.
    • (1982) Networks , vol.12 , pp. 411-427
    • Katoh, N.1    Ibaraki, T.2    Mine, H.3
  • 12
    • 0018019427 scopus 로고
    • Data structures and computer science techniques in operations research
    • Fox BL. Data structures and computer science techniques in operations research. Operations Research 1978;26: 686-717.
    • (1978) Operations Research , vol.26 , pp. 686-717
    • Fox, B.L.1
  • 13
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Eppstein D. Finding the k shortest paths. SIAM Journal of Computing 1998;28:652-73.
    • (1998) SIAM Journal of Computing , vol.28 , pp. 652-673
    • Eppstein, D.1
  • 14
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra EW. A note on two problems in connection with graphs. Numerische Mathematik 1959;1:269-71.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 15
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimization algorithms
    • Fredman ML, Tajan RE. Fibonacci heaps and their uses in improved network optimization algorithms. JACM 1987;34:596-615.
    • (1987) JACM , vol.34 , pp. 596-615
    • Fredman, M.L.1    Tajan, R.E.2

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