A flexible model and heuristics for the cyclic inventory routing problem

• Main Authors: An-Zuo Chen, 陳岸佐
• Other Authors: Shu-Chu Liu
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/25637624228255022927

碩士 === 國立屏東科技大學 === 資訊管理系所 === 98 === The purpose of this paper is to determine the route of the vehicle routing problem (VRP), inventory problem and flexible model and heuristics. The inventory-routing problem (IRP) with flexible model and heuristics considers inventory control and vehicle routing decision simultaneously and can reduce the cost of the logistics system significantly. However, flexible model will affect inventory cost and routing cost. Since finding the optimal solutions for CIRP is a NP-hard problem, this paper proposes a flexible heuristics method, variable neighborhood search (VNS), adopting five neighborhood and local search to obtain optimal solution. Our solution could reduce supply chain costs compared with the past.