Using genetic algorithms to solve combinatorial optimization problems
Genetic algorithms are stochastic search techniques based on the mechanics of natural selection and natural genetics. Genetic algorithms differ from traditional analytical methods by using genetic operators and historic cumulative information to prune the search space and generate plausible solution...
Main Author: | Cui, Xinwei |
---|---|
Format: | Others |
Published: |
FIU Digital Commons
1991
|
Subjects: | |
Online Access: | http://digitalcommons.fiu.edu/etd/2684 http://digitalcommons.fiu.edu/cgi/viewcontent.cgi?article=3893&context=etd |
Similar Items
-
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
by: Tapani Toivonen, et al.
Published: (2021-08-01) -
Algebraic algorithms in combinatorial optimization.
Published: (2011) -
A self-adaptive mechanism using weibull probability distribution to improve metaheuristic algorithms to solve combinatorial optimization problems in dynamic environments
by: Cesar J. Montiel Moctezuma, et al.
Published: (2020-01-01) -
Genetic and combinatorial algorithms for optimal sizing and placement of active power filters
by: Maciążek Marcin, et al.
Published: (2015-06-01) -
Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem
by: Son Tung Ngo, et al.
Published: (2021-06-01)