A general steady state distribution based stopping criteria for finite length genetic algorithms
Article Abstract:
Derivation of genetic algorithms for worst-case analysis of error bounds of heuristic search using Markov processes is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
User Contributions:
Comment about this article or add new information about this topic:
Learning genetic algorithm parameters using hidden Markov models
Article Abstract:
The usage of Markov models for addressing genetic algorithm problems in operations management is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Learning genetic algorithm parameters using hidden Markov models
Article Abstract:
Genetic algorithm parameters for the modeling of evolutionary processes are analyzed using Markov models.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Strip generation algorithms for constrained two-dimensional two-staged cutting problems. A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- Abstracts: Estimation of parameters in latent class models using fuzzy clustering algorithms. Density based fuzzy c-means clustering of non-convex patterns
- Abstracts: PetroChina domestic IPO gets approval. PetroChina clears IPO hurdle and shares rise. Roc Oil to drill in Angola: onshore exploration would be the first after years of unrest
- Abstracts: Positive half-products and scheduling with controllable processing times. Scheduling with controllable release dates and processing times: Makespan minimization
- Abstracts: Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem