Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

A Study on Area Division Method to use the Hour-based Vehicle Speed Information

시간단위 차량통행 속도정보의 활용을 위한 구역분할 방법의 연구

  • Park, Sung-Mee (Dept. of Industrial and Management Systems Engineering, Dong-A University) ;
  • Moon, Gee-Ju (Dept. of Industrial and Management Systems Engineering, Dong-A University)
  • 박성미 (동아대학교 산업경영공학과) ;
  • 문기주 (동아대학교 산업경영공학과)
  • Received : 2010.11.19
  • Accepted : 2010.12.03
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. 부산광역시; "부산광역시 차량통행속도 조사결과", 2008년도 부산광역시 교통조사, 부산시, 2009.
  2. A. V. Hill and W. C. Benton; "Modelling intra-city time-dependent travel speeds for vehicle scheduling problem," Journal of the Operational Research Society, 43(4): 343-351, 1992. https://doi.org/10.1057/jors.1992.49
  3. G. B. Dantzig and J. H. Ramser; "The truck dispatching problem," Management Science, 6(1): 80-91, 1959. https://doi.org/10.1287/mnsc.6.1.80
  4. G. Clarke and J. Wright; "Scheduling of vehicles from a central depot to a number of delivery point," Operations Research, 2(4) : 568-581, 1964.
  5. J. Y. Li and R. R. Rhinehart; "Heuristic random optimization," Computers and Chemical Engineering, 22 : 427-444, 1998.
  6. K. D. Boese, A. B. Kahng, and S. Muddu; "A new adaptive multi-start technique for combinatorial global optimizations," Operations Research Letters, 16 : 101-113, 1994. https://doi.org/10.1016/0167-6377(94)90065-5
  7. Keld Helsgaun; "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, 126 : 106-130, 2000. https://doi.org/10.1016/S0377-2217(99)00284-2
  8. M. Fisher, R. Jaikumar; "A generalized assignment heuristic for the vehicle routing problem," Networks, 11 : 109-124, 1981. https://doi.org/10.1002/net.3230110205
  9. M. G. Kang; "네트워크와 알고리즘", 박영사, 1999.
  10. M. Solomon; "Alogrithms for the vehicle routing and scheduling with time window constraints," Operations Research, 35: 254-265, 1987. https://doi.org/10.1287/opre.35.2.254
  11. N. Christofieds and S. Eillon; "An algorithm for the Vehicle Dispatching," Operations Research, 20: 309-318, 1969. https://doi.org/10.1057/jors.1969.75
  12. Z. B. Tang; "Optimal sequential sampling policy of partitioned random search and its applications," Journal of Optimization Theory and Applications, 102 : 157-175, 1997.
  13. Z. B. Zabinsky, "Stochastic methods for practical global optimization," Journal of Global Optimization, 13 : 433-444, 1998. https://doi.org/10.1023/A:1008350230239