Mathematical Programming Model for Solving the Time-Windowed Tool Relocation Problem

• Main Authors: Chao-Yu Chen, 陳昭瑜
• Other Authors: 楊烽正
• Format: Others
• Language: zh-TW
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/urtwqg

碩士 === 國立臺灣大學 === 工業工程學研究所 === 106 === This paper defines mixed-integer programming model which can solve time-windowed tool relocation problem. The decision maker can make an appropriate set-tlement and the unfulfilled amount in the public tool sharing system can be reduced by mixed-integer programming model. The model calculates the unfulfilled amount in the different case because of known increasing/decreasing rate and other parameters. The model determines the routing path, pickup and delivery amount in service stations. The general constraints are too complicated, so our research aims to develop a program to verify the correctness of the solutions and draw the routing path. Our research applies the model to the bike sharing system and use it to test some examples. If the truck in the bike sharing system transfer the bikes from stations to stations, the unfulfilled amount always declines. The performance of the mixed-integer is equal or better than the per-formance of canonical method.