Statistical design of genetic algorithms for combinatorial optimization problems
Summary: Many genetic algorithms (GA) have been applied to solve different NP-complete combinatorial optimization problems so far. The striking point of using GA refers to selecting a combination of appropriate patterns in crossover, mutation, and and so forth and fine tuning of some parameters such as crossover probability, mutation probability, and and so forth. One way to design a robust GA is to select an optimal pattern and then to search for its parameter values using a tuning procedure. This paper addresses a methodology to both optimal pattern selection and the tuning phases by taking advantage of design of experiments and response surface methodology. To show the performances of the proposed procedure and demonstrate its applications, it is employed to design a robust GA to solve a project scheduling problem. Through the statistical comparison analyses between the performances of the proposed method and an existing GA, the effectiveness of the methodology is shown.
- Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry
- A robust genetic algorithm for resource allocation in project scheduling
- Genetic Algorithms for Product Design
- scientific article; zbMATH DE number 1488083
- Genetic algorithms and their statistical applications: an introduction
- A formal analysis of the role of multi-point crossover in genetic algorithms
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A genetic algorithm for resource investment problem with discounted cash flows
- A genetic algorithm for the resource constrained multi-project scheduling problem
- A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations
- A robust genetic algorithm for resource allocation in project scheduling
- An introduction to genetic algorithms.
- Design and analysis of experiments.
- Evolutionary algorithms for single and multicriteria design optimization
- Fuzzy goal programming - an additive model
- scientific article; zbMATH DE number 4166884 (Why is no real title available?)
- scientific article; zbMATH DE number 5501647 (Why is no real title available?)
- scientific article; zbMATH DE number 3668602 (Why is no real title available?)
- scientific article; zbMATH DE number 3705806 (Why is no real title available?)
- scientific article; zbMATH DE number 42888 (Why is no real title available?)
- scientific article; zbMATH DE number 1300399 (Why is no real title available?)
- scientific article; zbMATH DE number 1086898 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- Introduction to evolutionary computing
- Parameter setting in evolutionary algorithms.
- Response surface methodology. Process and product optimization using designed experiments
- Search Heuristics for Resource Constrained Project Scheduling
- Towards structural optimization via the genetic algorithm
- Robustness and diversity in genetic algorithms for a complex combinatorial optimization problem
- scientific article; zbMATH DE number 1783009 (Why is no real title available?)
- scientific article; zbMATH DE number 1833483 (Why is no real title available?)
- On parameter configurations of genetic algorithm based on computer experiment
This page was built for publication: Statistical design of genetic algorithms for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410570)
