공급사슬 환경에서 제약이론을 적용한 재고 보충 및 차량경로문제 결정

Abstract

There was a lot of research to integration of the transshipment and inventory problem in supply chain. Such a integration of inventory and transshipment problem called IRP(Inventory Routing Problem). We consider a distribution problem in which a set of products has to be shipped from a supplier to several retailers in a given planning horizon. Transshipment from the supplier to the retailer is performed by vehicles of limited capcity. Each retailer determines replenishment leadtime and order quantity with buffer management. A supplier determines optimal vehicle routing in supply chain. We suggeste a heuristic algorithm which be used TOC buffer management in a replenishment problem and a tabu search algorithm in VRP(Vehcile Routing Problem).