Optimization of Transportation Problem in Dynamic Logistics Network

• 발행기관: 한국유통과학회
• 저자명: Ji Bok Chung Byung Cheon Choi
• 간행물 정보: 『유통과학연구(JDS)』제14권 제2호, 41~45쪽, 전체 5쪽
• 주제분류: 경제경영 > 경제학
• 파일형태: PDF
• 발행일자: 2016.02.28

영문 초록

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.

목차

Abstract

1. Introduction

2. Problem Description

3. Solution method for TP_dynamic

4. Conclusion

References

키워드

Time-Dependent Network Optimization Model Search Algorithm