earticle

논문검색

Optimising Maintenance Intervals for a Component using a New Hill-Climbing Algorithm

초록

영어

Maintenance reduces the occurrence of failures of a component (or IT product) and also extends its useful life. This way the time to dispose of such a component may be delayed and this reduces the rate at which greenhouse gases enter into the food chain and the atmosphere. It will be helpful to produce set of maintenance intervals for such component at which its extended useful life and cost are most improved. This set will consist of trade-offs between extended life and cost and is known as optimal set. This paper builds on earlier work to define the optimisation of the maintenance intervals of a given component with respect to its extended useful life and cost. The paper also establishes and uses a new approach of hill-climbing search algorithm.

목차

Abstract
 1. Introduction
 2. Optimisation Spaces
 3. Search Algorithms
  3.1. Genetic Algorithm
  3.2. Simulated Annealing
  3.3. Hill-climbing
 4. Steady Surface Hill-climbing (SSHC) Technique
 5. Results
  5.1. Small Population Size
  5.2. Large Population Size
 6. Conclusion
 References

저자정보

  • Shawulu Hunira Nggada Department of Computer Science, University of Hull, HU6 7RX, UK

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.