After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.
This paper considers an inbound ordering and outbound dispatching problem for multi-products and multi-vehicles in a third-party distribution center. The demands are dynamic over a discrete and finite time horizon, and replenishing orders are shipped in various transportation modes and the freight cost is proportional to the number of vehicles used. Any mixture of products is loaded onto any type of vehicles. The objective of the study is to simultaneously determine the inbound lot-sizes, the outbound dispatching sizes, and the types and numbers of vehicles used to minimize total costs, which consist of inventory holding cost and freight cost. Delivery time window is one of the general dispatching policies between a third-party distribution center and customers in practice. In the policy, each demand of product for a customer must be delivered within the time window without penalty cost. We derive mixed integer programming models for the dispatching policy with delivery time windows and on-time delivery dispatching policy, respectively and analyze the effect on a dispatching policy with delivery time windows by comparing with on-time delivery dispatching policy using various computational experiments.
본 연구에서는 차량용량이 같지 않은 복수의 다른 종류의 차량을 고려하여, 차량이 이동하면서 배달과 수거를 동시에 수행하고 수거지점으로부터 화물을 수거하여 차고지로 운송하는 귀로 화물(Backhauls)을 갖는 PDP(Pickup and Delivery Problem)문제를 그 연구 대상으로 한다. 동시에 차량을 통해 이동되는 품목이 단일 품목이 아니고, 배달 및 수거시간제약조건을 갖는 다품목 시간제약 수송차량 배차문제를 Time-space network를 이용하여 정수선형계획문제로 정식화한다. 이를 최적화 S/W LINGO를 이용하여 위의 모든 제약조건을 만족하면서 운용되는 차량수와 차량의 이동경로를 최소화하는 해를 구하고, 분석한 내용을 보여주고자 한다. 덧붙여 위 문제의 입·출력자료를 데이터베이스화하여 지리정보시스템(Geographic Information System : GIS)과 통합한 차량운행경로결정 지원시스템을 구축하기 위한 방법을 제시하고자 한다.