Export file:

Format

  • RIS(for EndNote,Reference Manager,ProCite)
  • BibTex
  • Text

Content

  • Citation Only
  • Citation and Abstract

A self-adaptive mechanism using weibull probability distribution to improve metaheuristic algorithms to solve combinatorial optimization problems in dynamic environments

1 Instituto Mexicano del Transporte, Querétaro
2 Tecnologico de Monterrey

Special Issues: Bio-inspired algorithms and Bio-systems

In last decades, the interest to solve dynamic combinatorial optimization problems has increased. Metaheuristics have been used to find good solutions in a reasonably low time, and the use of self-adaptive strategies has increased considerably due to these kind of mechanism proved to be a good alternative to improve performance in these algorithms. On this research, the performance of a genetic algorithm is improved through a self-adaptive mechanism to solve dynamic combinatorial problems: 3-SAT, One-Max and TSP, using the genotype-phenotype mapping strategy and probabilistic distributions to define parameters in the algorithm. The mechanism demonstrates the capability to adapt algorithms in dynamic environments.
  Figure/Table
  Supplementary
  Article Metrics
Download full text in PDF

Export Citation

Article outline

Copyright © AIMS Press All Rights Reserved