الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 178 |  |  |
| | | from | 178 | | |
Abstract
Due to the excess of the vehicle operations through its life, some
e lemenl:s ma.y [ace failure and deteriorate with time which leads us to
carry out maintenaJlce, repair, half overhaul or full overhaul. After a
certain period, the vehicle elements deteriorations increase with time
which m;:Jke the cost of doing the maintenance operations very high.
However, the logic decision is to replace the current vehicle by
another new one with minimum failure and maximum income.
Finding tile optimal replacement policy of equipments is one of the
important economic problems in most organizations. Several methods are
used to solve this problem, such as the enumeration, the shortest
path, the regeneration point approach and the dynamic programming
(D.P.) technique. In this research the D.P. technique is used. to solve
the practical problem existed. A survey about each of the methods and
their usage for solving such problems and the general applications of
D.P. is presented.
Param~tric study is made to investigate the effect of the change
of any daLa element and also Lhe effect of the income, maintenance
cost, or replacement cost rows on the optimal replacement policy. The
ameLric study reveals that the set of data elements can be divided
into two subsets, the first one may change freely without affecting
the optimal policy. The other subset will affect the opt i mal poli cy
and the relations to find the new total profit (or cost) due to any
change are fonnulated.
As a real application, the D.P. technique is used to find the
optimal replacement policy for TATA bus at EI-Minia University garage
in the period (1982/1983) to (2002/2003). It was found that the
replacement decision must be carried out at the end of the twelfth
year of the bus age.
Finally, a FORTRAN computer program based on the D. P. procedure is
wri tten to solve the problem, and general recommendations for future
researches in that field are presented.