An improved Lipschitz optimization algorithm for solving transportation fleet maintenance scheduling problem
碩士 === 東海大學 === 工業工程與經營資訊學系 === 98 === In this study, we propose an improved Lipschitz optimization algorithm secure a near-optimal solution for the Transportation Fleet Maintenance Scheduling Problem (TFMSP). By employing the proposed algorithm and a fine-tune procedure based on slope-checking, ste...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12201355350914546844 |
| Summary: | 碩士 === 東海大學 === 工業工程與經營資訊學系 === 98 === In this study, we propose an improved Lipschitz optimization algorithm secure a near-optimal solution for the Transportation Fleet Maintenance Scheduling Problem (TFMSP). By employing the proposed algorithm and a fine-tune procedure based on slope-checking, step-size comparison mechanisms, the search steps can be significantly reduced and the solutions can be secured within a very short run time. We provide a numerical example to demonstrate the efficiency of the proposed algorithm. To compare the computational performance, we test these search algorithms by random experiments with different values of the major setup cost and different size of vehicle groups. Based on our numerical experiments, we conclude that the proposed search algorithm can significantly outperform the dynamic Lipschitz optimization algorithm presented by Yao and Huang (2007) in run time as well as the quality of solutions.
|
|---|