Scheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithm

Ming-Jong Yao, Jia Yen Huang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This study proposes a new and improved Lipschitz optimization algorithm to obtain an ε-optimal solution for solving the transportation fleet maintenance-scheduling problem. It employs a procedure based on slope-checking and step-size comparison mechanisms to improve the computational efficiency of the Evtushenko algorithm. Our numerical experiments used 36,000 randomly generated instances to compare the run time and solution quality of our proposed algorithm with the alternative approach in the literature. Our results indicate that the run time of the proposed algorithm could be significantly improved by more than 80% in over 50% of instances in our numerical experiments. We conclude that our proposed algorithm significantly improves the computational efficiency of the conventional Evtushenko algorithm.

Original languageEnglish
Pages (from-to)592-609
Number of pages18
JournalOptimization Methods and Software
Volume29
Issue number3
DOIs
StatePublished - 4 May 2014

Keywords

  • Lipschitz programming

Fingerprint Dive into the research topics of 'Scheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithm'. Together they form a unique fingerprint.

Cite this