A Heuristic Method for the Combined Location Routing and Inventory Problem

• Main Authors: Chun-Chih Lin, 林俊志
• Other Authors: Shu-Chu Liu
• Format: Others
• Language: zh-TW
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/59242257703759365556

碩士 === 國立屏東科技大學 === 資訊管理系 === 91 === The combined location routing and inventory problem is to allocate depots from several potential locations, to schedule vehicles’ routes to meet customers’ demands, and to determine the inventory policy based on the information of customers’ demands, in order to minimize the total system cost. Since finding the optimal solution(s) for this problem is an NP (non-polynomial) problem, we propose a hybrid heuristic models incorporating tabu search (TS) into simulate annealing (SA) to solve the problem. The objective is to minimize the total costs among facility location, inventory and transportation. The results show the proposed method is better than those existing methods based on the total cost criterion. An analysis for several parameters is also conducted in this research.