A Study on Location Routing Problem and Production Scheduling for Perishable Goods

• Main Authors: Kun-Lin Chih, 池昆霖
• Other Authors: Huey-Kuo Chen
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/xzxy37

碩士 === 國立中央大學 === 土木工程研究所 === 94 === The value of the perishable goods will decrease by the time. In order to efficiently find the maximized profit for the manufactory, we try to integrate the production scheduling, vehicle routing problem, take into the location problem, time window constrains, and finally formulate a bi-level integer programming problem. We also propose a heuristic solution algorithm, and we fixed the location of depots at the upper-level, then to solve the lower-level. At the lower-level, we use the concept of decomposition to decompose the problem as production scheduling problem and vehicle routing problem. At the part of production schedule, we use the Nelder-Mead algorithm to solve, and use the modified insert method to construct the initial solution at the part of vehicle routing. As the result of increasing of market share ratios for frozen production by the day, therefore it is more important in the production scheduling for perishable goods and vehicle routing problem. And it’s a major factor for a business to determine the location in the beginning investment cost. The study solving the minimum long-term cost problem under the condition of short-termed optimization, therefore we construct a bi-level programming modal. For increasing the practicability of the modal, it will be an important research direction to set up friendly user interface and improve the efficient of algorithm in the future.