Presentation 2008-06-20
Simulated Annealing for Solving Optimal Component Arrangement Problems in a Circular Consecutive-k-out-of-n:F System
Koji SHINGYOCHI, Hisashi YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A circular consecutive-k-out-of-n:F system consists of n components arranged along a circular path. This system fails if k or more consecutive components fail. As n increases, because no invariant optimal arrangement of such system exists except for the cases of k=1, 2, n-2, n-1, n, the amount of calculation would be too much to obtain the exact solution within a reasonable computing time. In this paper, we have proposed two kinds of simulated annealing algorithms to obtain quasi optimal solutions for such problems. We compared their performances with two kinds of genetic algorithms proposed in previous work and demonstrated the advantage of our proposed algorithms through numerical experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Circular Consecutive-k-out-of-n:F System / Optimal Component Arrangement Problem / Simulated Annealing
Paper # R2008-17
Date of Issue

Conference Information
Committee R
Conference Date 2008/6/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Reliability(R)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Simulated Annealing for Solving Optimal Component Arrangement Problems in a Circular Consecutive-k-out-of-n:F System
Sub Title (in English)
Keyword(1) Circular Consecutive-k-out-of-n:F System
Keyword(2) Optimal Component Arrangement Problem
Keyword(3) Simulated Annealing
1st Author's Name Koji SHINGYOCHI
1st Author's Affiliation Faculty of Social and Computer Science, Jumonji University()
2nd Author's Name Hisashi YAMAMOTO
2nd Author's Affiliation Faculty of System Design, Tokyo Metropolitan University
Date 2008-06-20
Paper # R2008-17
Volume (vol) vol.108
Number (no) 95
Page pp.pp.-
#Pages 5
Date of Issue