Generating optimal design for ALT experiment with time censoring

Moein Saleh; Rong Pan

doi:10.1109/RAMS.2013.6517665

Generating optimal design for ALT experiment with time censoring

Moein Saleh, Rong Pan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

The computer generated optimal experimental designs have become popular as the computational capabilities of computers grow. For example, the optimal test plans of accelerated life tests (ALT) have received a lot of attentions from academia and practitioners in recent years. In this paper, we discuss a computational method for finding the D-optimal ALT plans through the generalized linear model (GLM) of accelerated life testing problem. A modified version of the point exchange algorithm (PEA) is developed. By comparing this algorithm with the quasi Newton method on an ALT planning problem, we demonstrate the superiority of our method in terms of speed and accuracy.

Original language	English (US)
Title of host publication	59th Annual Reliability and Maintainability Symposium, RAMS 2013 - Proceedings and Tutorials
DOIs	https://doi.org/10.1109/RAMS.2013.6517665
State	Published - Jul 1 2013
Event	59th Annual Reliability and Maintainability Symposium, RAMS 2013 - Orlando, FL, United States Duration: Jan 28 2013 → Jan 31 2013

Publication series

Name	Proceedings - Annual Reliability and Maintainability Symposium
ISSN (Print)	0149-144X

Other

Other	59th Annual Reliability and Maintainability Symposium, RAMS 2013
Country/Territory	United States
City	Orlando, FL
Period	1/28/13 → 1/31/13

Keywords

Weibull distribution
censoring
design of experiments
optimal designs
point exchange algorithm

ASJC Scopus subject areas

Safety, Risk, Reliability and Quality
Mathematics(all)
Computer Science Applications

Access to Document

10.1109/RAMS.2013.6517665

Cite this

Saleh, M & Pan, R 2013, Generating optimal design for ALT experiment with time censoring. in 59th Annual Reliability and Maintainability Symposium, RAMS 2013 - Proceedings and Tutorials., 6517665, Proceedings - Annual Reliability and Maintainability Symposium, 59th Annual Reliability and Maintainability Symposium, RAMS 2013, Orlando, FL, United States, 1/28/13. https://doi.org/10.1109/RAMS.2013.6517665

@inproceedings{9eb99808d9f64380ac0f8a79ef9f88b2,

title = "Generating optimal design for ALT experiment with time censoring",

abstract = "The computer generated optimal experimental designs have become popular as the computational capabilities of computers grow. For example, the optimal test plans of accelerated life tests (ALT) have received a lot of attentions from academia and practitioners in recent years. In this paper, we discuss a computational method for finding the D-optimal ALT plans through the generalized linear model (GLM) of accelerated life testing problem. A modified version of the point exchange algorithm (PEA) is developed. By comparing this algorithm with the quasi Newton method on an ALT planning problem, we demonstrate the superiority of our method in terms of speed and accuracy.",

keywords = "Weibull distribution, censoring, design of experiments, optimal designs, point exchange algorithm",

author = "Moein Saleh and Rong Pan",

year = "2013",

month = jul,

day = "1",

doi = "10.1109/RAMS.2013.6517665",

language = "English (US)",

isbn = "9781467347099",

series = "Proceedings - Annual Reliability and Maintainability Symposium",

booktitle = "59th Annual Reliability and Maintainability Symposium, RAMS 2013 - Proceedings and Tutorials",

note = "59th Annual Reliability and Maintainability Symposium, RAMS 2013 ; Conference date: 28-01-2013 Through 31-01-2013",

}

TY - GEN

T1 - Generating optimal design for ALT experiment with time censoring

AU - Saleh, Moein

AU - Pan, Rong

PY - 2013/7/1

Y1 - 2013/7/1

N2 - The computer generated optimal experimental designs have become popular as the computational capabilities of computers grow. For example, the optimal test plans of accelerated life tests (ALT) have received a lot of attentions from academia and practitioners in recent years. In this paper, we discuss a computational method for finding the D-optimal ALT plans through the generalized linear model (GLM) of accelerated life testing problem. A modified version of the point exchange algorithm (PEA) is developed. By comparing this algorithm with the quasi Newton method on an ALT planning problem, we demonstrate the superiority of our method in terms of speed and accuracy.

AB - The computer generated optimal experimental designs have become popular as the computational capabilities of computers grow. For example, the optimal test plans of accelerated life tests (ALT) have received a lot of attentions from academia and practitioners in recent years. In this paper, we discuss a computational method for finding the D-optimal ALT plans through the generalized linear model (GLM) of accelerated life testing problem. A modified version of the point exchange algorithm (PEA) is developed. By comparing this algorithm with the quasi Newton method on an ALT planning problem, we demonstrate the superiority of our method in terms of speed and accuracy.

KW - Weibull distribution

KW - censoring

KW - design of experiments

KW - optimal designs

KW - point exchange algorithm

UR - http://www.scopus.com/inward/record.url?scp=84879387802&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879387802&partnerID=8YFLogxK

U2 - 10.1109/RAMS.2013.6517665

DO - 10.1109/RAMS.2013.6517665

M3 - Conference contribution

AN - SCOPUS:84879387802

SN - 9781467347099

T3 - Proceedings - Annual Reliability and Maintainability Symposium

BT - 59th Annual Reliability and Maintainability Symposium, RAMS 2013 - Proceedings and Tutorials

T2 - 59th Annual Reliability and Maintainability Symposium, RAMS 2013

Y2 - 28 January 2013 through 31 January 2013

ER -

Generating optimal design for ALT experiment with time censoring

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this