A new optimal search algorithm for the transportation fleet maintenance scheduling problem

Ming-Jong Yao*, Jia Yen Huang

*Corresponding author for this work

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

In this study, we propose a new solution approach for the Transportation Fleet Maintenance Scheduling Problem (TFMSP). Before presenting our solution approach, we first review Goyal and Gunasekaran's [International Journal of Systems Science, 23 (1992) 655-659] mathematical model and their search procedure for determining the economic maintenance frequency of a transport fleet. To solve the TFMSP, we conduct a full analysis on the mathematical model. By utilizing our theoretical results, we propose an efficient search algorithm that finds the optimal solution for the TFMSP within a very short run time. Based on our experiments using random data, we conclude that the proposed search algorithm out-performs Goyal and Gunasekaran's search procedure.

Original languageEnglish
Pages (from-to)33-48
Number of pages16
JournalJournal of the Operations Research Society of Japan
Volume49
Issue number1
DOIs
StatePublished - 1 Jan 2006

Keywords

  • Algorithm
  • Maintenance
  • Mathematical model
  • Scheduling

Fingerprint Dive into the research topics of 'A new optimal search algorithm for the transportation fleet maintenance scheduling problem'. Together they form a unique fingerprint.

  • Cite this