On the Joint Replenishment Problem Considering Delivery-Zone, Vehicle Capacity and Routing Planning
|關鍵字:||合併補貨;運區;運能;路線;演算法;joint replenishment;delivery-zone;vehicle capacity;vehicle routing;algorithm|
replenishment)，節省主要的設置成本(major setup costs)；例如：換模換線成本或採購作
問題」(Joint Replenishment Problem, JRP)。
Inventory control and management plays a key role in supply chain management. Batch replenishment is one of the most popular inventory control policies among most of the production and distribution systems in supply chains. The coordination of lot sizing and scheduling for batch replenishment determines the two major cost items: inventory holding cost and setup cost. For some packaging and distribution systems, the decision makers are able to take advantage of jointly replenish several products so as to save the major setup cost, which could be the change-over cost or the ordering cost. Therefore, it becomes a critical research topic to determine the lot size of products and to coordinate the replenishment schedule in supply chain management, and it is well known as the Joint Replenishment Problem in the literature. The managers have to include the transportation operations as working on the replenishment plan for production and distribution systems in the real world. The three most important planning activities are the delivery-zone planning of transportation vehicles, the capacity planning of transportation vehicles, and the routing planning of transportation vehicles. In this research project, we will consider not only the inventory holding cost and the setup cost, but also the transportation costs incurred in the replenishment operations, and also take into account the constraints of vehicle capacity. In the long run, the managers should take care of the capacity planning of transportation vehicles, and also, are responsible to the delivery-zone planning to meet the demand change of products. In the short run, the managers have to determine the replenishment cycles and the assigned vehicle for each product, and the route of each vehicle to meet the capacity constraint of each vehicle and to minimize the total average costs in the system. This is a three-year project proposal that would investigate the following three subjects. The first research topic: On the joint replenishment problem considering the delivery-zone planning of the transportation fleet. The second research topic: On the joint replenishment and lot scheduling problem considering the vehicle capacity planning. The third research topic: On the joint replenishment and lot scheduling problem considering the vehicle routing and delivery-zone planning. For each research topic, we plan to do the following task items. First, we shall derive the corresponding mathematical model. Then, we conduct full theoretical analysis that provides interesting insights into the optimality structure of the mathematical model. Also, by making use of our theoretical results, we propose appropriate methodology and/or derive effective algorithms that are able to obtain a close-to-optimal solution or an optimal solution for the corresponding scenario. Finally, we will verify that the proposed solution methodology via extensive numerical experiments. We are confident that the outputs of this project shall serve as effective decision-support tools that assist the managers face the joint replenishment and lot scheduling problem with the considerations of delivery-zone planning, vehicle capacity constraints and vehicle routing planning.