genetic algorithm
PID Tuning Using Genetic Algorithm
PID Tuning Using Genetic Algorithm - PID controller has been extensively used in the industrial world. more>> PID Tuning Using Genetic Algorithm is a convenient tool including PID controller that has been extensively used in the industrial world.
PID controller has been extensively used in the industrial world. But in this controller it is difficult to tune the PID gains. Apply the genetic algorithm(GA) to tune the PID gains. The GA is agorithm using the biotic; gene the biotic; genetics.
Genetic Algorithm Java Application
Genetic Algorithm Java Application was designed to solve the Geodetic Cover Problem. more>>
Genetic Algorithm Java Application is the most comprehensive, fast solution for the Geodetic Cover Problem.
This program is limited to personal use only. Modification and/or redistribution without specific consent from the author is strictly prohibited.
Major Features:
- Genetic algorithms are a form of artificial intelligence in which the theory of evolution is used to find an approximate answer to a given problem.
- In this research project is a genetic algorithm to search for geodetic covers of random graphs. A geodetic cover is defined as the subset S of vertices of a graph such that any vertex not in S is on a shortest path between two vertices in S.
- Specifically, the program was designed to solve the Geodetic Cover Problem; namely, to find the smallest geodetic cover. The results show that the genetic algorithm is considerably faster than other algorithms used to solve the problem but produces suboptimal results for large graphs.
Traveling Salesman Problem - Genetic Algorithm
Traveling Salesman Problem - Genetic Algorithm is designed to be a useful MATLAB tool that finds a near-optimal solution to a Traveling Salesman Problem using a Genetic Algorithm in a GUI environment. more>>
Traveling Salesman Problem - Genetic Algorithm is designed to be a useful MATLAB tool that finds a near-optimal solution to a Traveling Salesman Problem using a Genetic Algorithm in a GUI environment.
Open Traveling Salesman Problem - Genetic Algorithm
Open Traveling Salesman Problem - Genetic Algorithm is created to be a useful MATLAB function which finds a near-optimal solution to a open variation of the Traveling Salesman Problem using a Genetic Algorithm. more>>
Open Traveling Salesman Problem - Genetic Algorithm is created to be a useful MATLAB function which finds a near-optimal solution to a "open" variation of the Traveling Salesman Problem using a Genetic Algorithm.
Multiple Traveling Salesmen Problem - Genetic Algorithm
Multiple Traveling Salesmen Problem - Genetic Algorithm is known as a useful MATLAB script that finds a near-optimal solution to a Multiple Traveling Salesman Problem using a Genetic Algorithm. more>>
Multiple Traveling Salesmen Problem - Genetic Algorithm is known as a useful MATLAB script that finds a near-optimal solution to a Multiple Traveling Salesman Problem using a Genetic Algorithm.
Open Multiple Traveling Salesmen Problem - Genetic Algorithm
Open Multiple Traveling Salesmen Problem - Genetic Algorithm is considered as a useful MATLAB script that will help you find a near-optimal solution to a open variation of the Multiple Traveling Salesman Problem using a genetic algorithm. more>>
Open Multiple Traveling Salesmen Problem - Genetic Algorithm is considered as a useful MATLAB script that will help you find a near-optimal solution to a "open" variation of the Multiple Traveling Salesman Problem using a genetic algorithm .
Fixed Start Open Traveling Salesman Problem - Genetic Algorithm
Fixed Start Open Traveling Salesman Problem - Genetic Algorithm is designed to be a useful MATLAB function that finds a near-optimal solution to a open variation of the Traveling Salesman Problem with fixed start points using a genetic algorithm. more>>
Fixed Start Open Traveling Salesman Problem - Genetic Algorithm is designed to be a useful MATLAB function that finds a near-optimal solution to a "open" variation of the Traveling Salesman Problem with fixed start points using a genetic algorithm.
Multiple Variable Traveling Salesmen Problem - Genetic Algorithm
Multiple Variable Traveling Salesmen Problem - Genetic Algorithm is known as a useful MATLAB script for you to find a near-optimal solution to a variation of the Multiple Traveling Salesman with variable number of salesmen using a genetic algorithm. more>> Multiple Variable Traveling Salesmen Problem - Genetic Algorithm is known as a useful MATLAB script for you to find a near-optimal solution to a variation of the Multiple Traveling Salesman with variable number of salesmen using a genetic algorithm.<<less
Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm
Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm is very useful because it is a MATLAB script that finds a near-optimal solution to a open variation of the Traveling Salesman Problem with fixed endpoints using a Genetic Algorithm. more>>
Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm is very useful because it is a MATLAB script that finds a near-optimal solution to a "open" variation of the Traveling Salesman Problem with fixed endpoints using a Genetic Algorithm.
Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm
Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm is designed as a smart and useful MATLAB script for finding a near-optimal solution to a open variation of the Multiple Traveling Salesman with fixed start points using a genetic algorithm. more>> <<less
Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm
Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm is created to be a useful MATLAB script that finds a near-optimal solution to a open variation of the Multiple Traveling Salesman with fixed endpoints using a genetic algorithm. more>> Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm is created to be a useful MATLAB script that finds a near-optimal solution to a "open" variation of the Multiple Traveling Salesman with fixed endpoints using a genetic algorithm.<<less
Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm
Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm is considered as a very useful MATLAB script that finds a near-optimal solution to a variation of the Multiple Traveling Salesman Problem with fixed endpoints using a genetic algorithm. more>>
Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm is considered as a very useful MATLAB script that finds a near-optimal solution to a variation of the Multiple Traveling Salesman Problem with fixed endpoints using a genetic algorithm.
Odds algorithm 1.0
This class implements the odds algorithm created by F. Thomas Bruss. This is a decision making support algorithm is used for instance to determine the right moment stop negotiations. more>> This class implements the odds algorithm created by F. Thomas Bruss. This is a decision making support algorithm is used for instance to determine the right moment stop negotiations.<<less
This is a decision making support algorithm is used for instance to determine the right moment ... This is a decision making support algorithm is used for instance to determine the right momentActionscript MD5
An ActionScript implementation of MD5 hash algorithm. This Actionscript is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm. more>> An ActionScript implementation of MD5 hash algorithm. This Actionscript is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm.<<less
Using the Deque class in Recursive Algorithms 1.0
This snippet focuses on the uses of the STL deque class in a recursive algorithm, namely to solve a maze. more>> This snippet focuses on the uses of the STL deque class in a recursive algorithm, namely to solve a maze.<<less
This snippet focuses on the uses of the STL deque class in a recursive algorithm, namely to solve ... This snippet focuses on the uses of the STL deque class in a recursive algorithm, namely to solve