Fitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
Authors
Abstract:
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requirement for effective methods of Weibull parameters estimation. It is a known fact that the estimation procedure is inherently a very complicated procedure when the three-parameter Weibull distribution is of interest. Hence, this study suggests a computational approach, greedy randomized adaptive search procedures, with several neighborhood local searches to enhance the quality of estimations. Computational experiments are also implemented to assess the quality of estimations as opposed to benchmark grid search algorithm.
similar resources
Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
full textA Greedy Randomized Adaptive Search Procedure for Job Shop Scheduling
In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A sc...
full textGreedy Randomized Adaptive Search Procedure for Traveling Salesman Problem
Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem. (May 2005) Seung Ho Lee, B.E., Korea University Chair of Advisory Committee: Dr. Sergiy Butenko In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-...
full textLeast squares fitting the three - parameter inverse Weibull density ∗
The inverse Weibull model was developed by Erto [10]. In practice, the unknown parameters of the appropriate inverse Weibull density are not known and must be estimated from a random sample. Estimation of its parameters has been approached in the literature by various techniques, because a standard maximum likelihood estimate does not exist. To estimate the unknown parameters of the three-param...
full textGreedy Randomized Adaptive Search Procedures
GRASP (greedy randomized adaptive search procedure) is a metaheuristic for combinatorial optimization. GRASP usually is implemented as a multistart procedure, where each iteration is made up of a construction phase, where a randomized greedy solution is constructed, and a local search phase which starts at the constructed solution and applies iterative improvement until a locally optimal soluti...
full textGreedy Randomized Adaptive Search Procedures
GRASP is an iterative multi-start metaheuristic for solving difficult combinatorial problems. Each GRASP iteration consists of two phases: a greedy adaptive randomized construction phase and a local search phase. Starting from the feasible solution built during the greedy adaptive randomized construction phase, the local search explores its neighborhood until a local optimum is found. The best ...
full textMy Resources
Journal title
volume 30 issue 3
pages 424- 431
publication date 2017-03-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023