시간단위 차량통행 속도정보의 활용을 위한 구역분할 방법의 연구
A Study on Area Division Method to use the Hour-based Vehicle Speed Information
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.
Abstract
This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.
참고문헌 (13)
- 부산광역시, "부산광역시 차량통행속도 조사결과", 2008년도 부산광역시 교통조사,부산시, ~ (2009)
- A.V.Hill, "Modelling intra-city time-dependent travel speeds for vehicle scheduling problem", Journal of the Operational Research Society, 43(4), pp.343~351 (1992)
- G.B.Dantzig, "The truck dispatching problem", Management Science, 6(1), pp.80~91 (1959)
- G.Clarke, "Scheduling of vehicles from a central depot to a number of delivery point", Operations Research, 2(4), pp.568~581 (1964)
- J.Y.Li, "Heuristic random optimization", Computers and Chemical Engineering, 22, pp.427~444 (1998)
- K.D.Boese, "A new adaptive multi-start technique for combinatorial global optimizations", Operations Research Letters, 16, pp.101~113 (1994)
- Keld Helsgaun, "An effective implementation of the Lin-Kernighan traveling salesman heuristic", European Journal of Operational Research, 126, pp.106~130 (2000)
- M.Fisher, "A generalized assignment heuristic for the vehicle routing problem", Networks, 11, pp.109~124 (1981)
- M.G.Kang, "네트워크와 알고리즘" (1999), 박영사
- M.Solomon, "Alogrithms for the vehicle routing and scheduling with time window constraints", Operations Research, 35, pp.254~265 (1987)
- N.Christofieds, "An algorithm for the Vehicle Dispatching", Operations Research, 20, pp.309~318 (1969)
- Z.B.Tang, "Optimal sequential sampling policy of partitioned random search and its applications", Journal of Optimization Theory and Applications, 102, pp.157~175 (1997)
- Z.B.Zabinsky, "Stochastic methods for practical global optimization", Journal of Global Optimization, 13, pp.433~444 (1998)