Home   >   CSC-OpenAccess Library   >    Manuscript Information
Solution algorithms for a deterministic replacement problem
Zakir H. Ahmed
Pages - 233 - 242     |    Revised - 30-06-2010     |    Published - 10-08-2010
Volume - 4   Issue - 3    |    Publication Date - July 2010  Table of Contents
Deterministic replacement, Lexisearch, Genetic algorithms, Bottleneck
We consider the life of a k-series system with n-k standbys, which are to replace the working items as they fail in a specified order. Also the life of each item is assumed to be known. The problem is to find the first k elements to be used in the system to start with and the sequence in which replacements are to be made such that the system life is maximized. It is pointed out that this problem is essentially a ‘bottle-neck’ problem in that it is equivalent to partitioning n numbers into k subsets (parts) such that the minimum of the k part-sums is maximized. Effective bounds can be computed for the optimum solution value and this can be used to develop an efficient lexisearch algorithm for optimization. Also the paper develops a genetic algorithm which gives heuristically optimal solution to the problem. The efficiency of the genetic algorithm to the ‘bottle-neck’ maximin problem as against lexisearch algorithm has been examined for some randomly generated instances of different sizes.
CITED BY (2)  
1 P. Biswas and S. Pramanik. “Replacement Problem with Grey Parameters.” International Journal of Computer Applications, 32(9), pp. 11-16, October 2011.
2 Biswas, P., & Pramanik, S. (2011). Replacement Problem with Grey Parameters. International Journal of Computer Applications (0975-8887), 32(9), 11-16.
1 Google Scholar 
2 Academic Journals Database 
3 Academic Index 
4 CiteSeerX 
5 ResearchGATE 
6 Libsearch 
7 Bielefeld Academic Search Engine (BASE) 
8 Scribd 
9 WorldCat 
10 SlideShare 
11 PdfSR 
13 Chinese Directory Of Open Access 
A. Savic, G. Walters and J. Knezevic. "Optimal, opportunistic maintenance policy using genetic algorithms, 2: analysis". Journal of Quality in Maintenance Engineering 1(3), pp. 25-34, 1995.
D.E. Goldberg. “Genetic algorithms in search, optimization, and machine learning”. Addison Wesley, Reading, MA, 1989.
H. Wang and H. Pham. "Reliability and Optimal Maintenance". Springer, 2006.
H. Wang. "A survey of maintenance policies of deteriorating systems". European Journal of Operational Research 139, pp. 469-489, 2002.
J.D.E. Little, K.G. Murthy, D.W. Sweeny and C. Karel. "An algorithm for the travelling salesman problem". Operations Research 11, pp. 972-989, 1963.
K. Deb. “Optimization for engineering design: algorithms and examples”. Prentice Hall of India Pvt. Ltd., New Delhi, India, 1995.
K.-H. Wang and B.D. Sivazlian. "Life cycle cost analysis for availability and reliability of series system with warm standbys components". International Conference on Computers and Industrial Engineering, Puerto Rico, U.S.A., 1997.
K.S. Park. "Reliability of a system with standbys and spares". Journal of Korean Institute of Industrial Engineering 3(1), Dec 1977.
L. Cui and H. Li. "Opportunistic maintenance for multi-component shock models". Journal of Mathematical Methods of Operations Research 63(3), pp. 180-191, 2006
L.M. Pintelon and L.F. Gelders. "Maintenance management decision making". European Journal of Operational Research 58(3), pp. 209-218, 1985.
M.S. Samhouri, A. Al-Ghandoor, R.H. Fouad and S.M.A. Ali. "An intelligent opportunistic maintenance (OM) system: a genetic algorithm approach". Jordan Journal of Mechanical and Industrial Engineering 3(4), pp. 246-251, 2009.
S.N.N. Pandit. “Some quantitative combinatorial search problems”. PhD Thesis, Indian Institute of Technology, Kharagpur, India, 1963.
X. Zhaou, L. Xi and J. Lee. "A dynamic opportunistic maintenance policy for continuously monitored system". Trans. J. of Quality Management Engineering 12(3), pp. 294-305, 2006.
X. Zhaou, L. Xi and J. Lee. "Opportunistic preventive maintenance scheduling for a multi-unit series system based on dynamic programming". International Journal of Production Economics, 2008.
Z.H. Ahmed, S.N.N. Pandit, and M. Borah. "On the solution of a deterministic replacement problem". Presented in National Seminar on Advancing Frontiers in Statistics and Operations Research, Dibrugarh University, Assam, India, During September 22 - 24, 1997.
Z.H. Ahmed. "A lexisearch algorithm for the bottleneck traveling salesman problem". International Journal of Computer Science and Security 3, pp. 569-577, 2010.
Z.H. Ahmed. "A sequential constructive sampling and related approaches to combinatorial optimization". PhD Thesis, Tezpur University, Assam, India, 2000.
Z.H. Ahmed. "Genetic algorithm for the traveling salesman problem using sequential constructive crossover". International Journal of Biometrics & Bioinformatics 3, pp. 96-105, 2010.
Mr. Zakir H. Ahmed
- Saudi Arabia

View all special issues >>