A Heuristic Algorithm for A Multi-Product Dynamic Production and Transportation Problem

다종제품의 동적 생산-수송 문제를 위한 휴리스틱 알고리즘

This paper analyzes a dynamic lot-sizing problem, in which the order size of multiple products and a single container type are simultaneously considered. In the problem, each order (product) placed in a period is immediately shipped immediately by containers in the period and the total freight cost is proportional to the number of each container type employed. Also, it is assumed that backlogging is not allowed. The objective of this study is to determine the lot-sizes and the shipping policy that minimizes the total costs, which consist of ordering costs, inventory holding costs, and freight costs. Because this problem is NP-hard, we propose a heuristic algorithm with an adjustment mechanism, based on the optimal solution properties. The computational results from a set of simulation experiment are also presented.