An Improved Lipschitz optimization algorithm for solving transportation fleet maintenance scheduling problem
In this study, we propose an improved Lipschitz optimization algorithm obtains an ε- optimal solution for the Transportation Fleet Maintenance Scheduling Problem (TFMSP). By employing the proposed algorithm and a fine-tune procedure based on slop-checking, step-size comparison mechanisms, the search steps can be significant reduce and the solutions can be secured within a very short run time. We compare the proposed search algorithm with the other solution approaches in the literature by randomly generated instances from different parameter settings. Based on our numerical experiments, we conclude that the proposed search algorithm significantly outperforms the other solution approaches in the literature.
Lipschitz optimization algorithm maintenance scheduling
Ming-Jong Yao Jia-Yen Huang Cheng-Yu Yeh
Department of Transportation Technology and Management,National Chiao Tung University, 1001 Universi Department of Information Management,National Chin-Yi University of Technology, Taichung City, Taiwa Department of Industrial Engineering and Enterprise Information,Tunghai University, Taichung City, T
国际会议
上海
英文
239-240
2010-12-10(万方平台首次上网日期,不代表论文的发表时间)