대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제32권2호
  • /
  • Pages.91-97
  • /
  • 2006
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

외주차량을 고려한 시간제약이 있는 차량경로문제에 대한 연구

Vehicle Routing Problem with Time Windows considering Outsourcing Vehicles

  • 성준 (부산대학교 산업공학과) ;
  • 문일경 (부산대학교 산업공학과)
  • Seong, June (Department of Industrial Engineering, Pusan National University) ;
  • Moon, Il-Kyeong (Department of Industrial Engineering, Pusan National University)
  • 발행 : 2006.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The vehicle routing problem with time windows (VRPTW) is an important problem in third party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV) which allows the overtime of drivers and the possibility of using outsourcing vehicles. This problem can be applied to third party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and a manufacturer. We develop a mixed integer programming model and a genetic algorithm. Computational results demonstrate the efficiency of the developed genetic algorithm. We also develop a decision support system based on this genetic algorithm.

키워드

참고문헌

  1. Badeau, P., Guertin, F., Gendreau, M., Potvin, J., and Taillard, E. (1997), A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows, Transportation Research Part C : Emerging Technologies, 5, 109-122 https://doi.org/10.1016/S0968-090X(97)00005-3
  2. Homberger, J. and Gehring, H. (2005), A Two-phase Hybrid Metaheuristic for the Vehicle Routing Problem with Time Windows, European Journal of Operational Research, 162, 220-238 https://doi.org/10.1016/j.ejor.2004.01.027
  3. Hong, S. and Park, Y. (1999), A Heuristic for Bi-objective Vehicle Routing with Time Window Constraints, International Journal of Production Economics, 62, 249-258 https://doi.org/10.1016/S0925-5273(98)00250-3
  4. Lenstra, J. and Kan R. (1981), Complexity of Vehicle Routing and Scheduling Problems, Networks, 11, 221-227 https://doi.org/10.1002/net.3230110211
  5. Liu, F. and Shen, S. (1999), An Overview of a Heuristic for Vehicle Routing Problem with Time Windows, Computers & Industrial Engineering, 37, 331-334 https://doi.org/10.1016/S0360-8352(99)00086-8
  6. Solomon, M. (1987), Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, 35, 254-265 https://doi.org/10.1287/opre.35.2.254
  7. VRPTW Benchmark Problems [Online]. Available: 'http://web.cba.neu.edu/~msolomon/problems.htm