RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재 SCOPUS

    Optimization of Transportation Problem in Dynamic Logistics Network

    한글로보기

    https://www.riss.kr/link?id=A103609081

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
      • URL 복사
    • 오류접수
    인용문이 복사되었습니다.

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    Purpose Finding an optimal – path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node.
    Research design, data, and methodology – To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution.
    Results – First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network.
    Conclusions – We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them.
    Extending our models for visiting two or more destinations is one of the further research topics.
    번역하기

    Purpose Finding an optimal – path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practic...

    Purpose Finding an optimal – path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node.
    Research design, data, and methodology – To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution.
    Results – First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network.
    Conclusions – We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them.
    Extending our models for visiting two or more destinations is one of the further research topics.

    더보기

    참고문헌 (Reference)

    1 송장근, "택배산업의 서비스품질 성과형성 모델" 한국유통과학회 10 (10): 37-45, 2012

    2 Sherali, H. D., "The Time-Dependent Shortest Pair of Disjoint Paths Problem : Complexity, models, and algorithms" 31 (31): 259-272, 1998

    3 Low, S. P., "The Application of the Just-in-Time Philosophy in the Chinese Construction Industry" 16 (16): 91-111, 2011

    4 El-Sherbeny, N. A., "The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows" 5 : 2764-2770, 2014

    5 Orda, A., "Shortest-path and Minimum Delay Algorithms in Networks with Time-dependent Edge-length" 37 (37): 607-625, 1990

    6 Ahuja, R. K., "Network Flows: Theory, Algorithms, and Applications" Prentice Hall 1993

    7 Amrapali, D., "Network Analysis for Finding Shortest Pathin Hospital Information System" 5 (5): 618-623, 2015

    8 Dewen, S., "Multiple Constrained Dynamic Path Optimization based on Improved Ant Colony Algorithm" 7 (7): 117-130, 2014

    9 Shuai Zhai, "Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery" 한국유통과학회 10 (10): 19-24, 2012

    10 Brian, D., "Introduction Algorithms for Minimum-Cost Paths in Time-Dependent Networks with Waiting Policies" 44 (44): 41-46, 2004

    1 송장근, "택배산업의 서비스품질 성과형성 모델" 한국유통과학회 10 (10): 37-45, 2012

    2 Sherali, H. D., "The Time-Dependent Shortest Pair of Disjoint Paths Problem : Complexity, models, and algorithms" 31 (31): 259-272, 1998

    3 Low, S. P., "The Application of the Just-in-Time Philosophy in the Chinese Construction Industry" 16 (16): 91-111, 2011

    4 El-Sherbeny, N. A., "The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows" 5 : 2764-2770, 2014

    5 Orda, A., "Shortest-path and Minimum Delay Algorithms in Networks with Time-dependent Edge-length" 37 (37): 607-625, 1990

    6 Ahuja, R. K., "Network Flows: Theory, Algorithms, and Applications" Prentice Hall 1993

    7 Amrapali, D., "Network Analysis for Finding Shortest Pathin Hospital Information System" 5 (5): 618-623, 2015

    8 Dewen, S., "Multiple Constrained Dynamic Path Optimization based on Improved Ant Colony Algorithm" 7 (7): 117-130, 2014

    9 Shuai Zhai, "Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery" 한국유통과학회 10 (10): 19-24, 2012

    10 Brian, D., "Introduction Algorithms for Minimum-Cost Paths in Time-Dependent Networks with Waiting Policies" 44 (44): 41-46, 2004

    11 Nejad, M., "Hierarchical Time-DependentShortestPathAlgorithms for Vehicle Routing under ITS" 48 (48): 158-169, 2016

    12 Abbasi, S., "Finding the Shortest Path in Dynamic Network using Labeling Algorithm" 2 (2): 239-243, 2011

    13 Yajun, Y., "Finding the Cost Optimal Path with Time Constraint over Time Dependent Graphs" 7 (7): 673-684, 2014

    14 Jiang, J., "Dynamic Navigation Algorithm Considering Network Disruptions" XL-4 : 111-115, 2014

    15 Dreyfus, S. E., "AnAppraisal of Some Shortest Path Algorithms" 17 (17): 395-412, 1969

    16 Horst, W. H., "Algorithms for Time-Dependent Bicriteria Shortest Path Problems" 3 : 238-254, 2006

    17 Dijkstra, E. W., "A Note on Two Problems in Connection with Graphs" 1 : 269-271, 1959

    18 Maurizio, B., "A Multi-Objective Time-Dependent Route Planner : a Real World Application to Milano city" 3 : 460-469, 2014

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2023 평가 해외DB학술지평가 신청대상 (해외등재 학술지 평가)
    2020-01-01 등재 등재학술지 유지 (해외등재 학술지 평가) KCI등재
    2013-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    2012-01-01 등재 등재후보 1차 PASS (등재후보1차) KCI등재후보
    2010-01-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    2005-01-24 학회명변경 영문명 : Korean Academy Of Distribution Science -> Korea Distribution Science Association
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.72 0.72 0.69
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.7 0.72 0.762 0.31
    더보기
    해외이동버튼