Genetic algorithms are a particular class of evolutionary algorithms (also known as evolutionary computation) that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover (also called recombination).

Genetic algorithms are imlpemented as a computer simulation in which a population of abstract representations (called chromosomes or the genotype or the genome) of candidate solutions (called individuals, creatures, or phenotypes) to an optimization problem evolves toward better solutions.

Genetic Algorithm Library contains a set of classes and utilities which provides easy way to use genetic algorithms to solve optimization problems in C++ applications. The library provides many genetic operations and several types of algorithms. It is highly customizable and easy to use. Only Microsoft Windows platform, Microsoft Visual C++ and Intel C++ compilers are supported. genetic Algorithm library is currently is in beta testing.

Basic features of the library:

• Many genetic operations, chromosomes representation interfaces and different genetic algorithm.
• Easy customization of the library by using provided interfaces for genetic operations and chromosome representations.
• Support for multiple processors/cores with multithreaded execution of genetic algorithms.

MendelSolve allows you to solve optimisation problems in Excel using a genetic algorithm (GA) approach. In much the same way as Solver works it takes a target formula and adjusts inputs to minimise or maximise the result. The advantages of the genetic algorithm approach is its ability to solve non-linear problems and avoid getting locked into a local minimum or maximum. MendelSolve uses an off-the-shelf configuration that works well in most situations but does allow for various parameters to be altered.

A.I. Solver Studio is a unique pattern recognition application that deals with finding optimal solutions to classification problems and uses several powerful and proven artificial intelligence techniques including neural networks, genetic programming and genetic algorithms. No special knowledge is required of users as A.I. Solver Studio manages all the complexities of the problem solving internally. This leaves users free to concentrate on formulating their problems of interest.Typically, all that is required of users is that they formulate their problems by creating training data and test data. A.I. Solver Studio is capable of reading virtually any kind delimited text file format where each line represents one data item. By testing solutions on testing data after each training iteration users have clear picture of how their solution performs in real world scenarios at any given time and can use this data to decide when a solution is good enough for their needs.

A.I. Solver Studio is a unique pattern recognition application that deals with finding optimal solutions to classification problems and uses several powerful and proven artificial intelligence techniques including neural networks, genetic programming and genetic algorithms. No special knowledge is required of users as A.I. Solver Studio manages all the complexities of the problem solving internally.

GAtree is a decision tree builder that uses genetic algorithms.The idea behind it is rather simple but powerful. Instead of using statistic metrics that are biased towards specific trees we use a more flexible global metric of tree quality and we try to evolve the best decision tree. Gatree offers some unique features not to be found in any other tree inducers while at the same time it can produce better results for a number of difficult problems

JOpt.SDK is a route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

Financial analysis and investment software that combines traditional technical analysis with state-of-the-art artificial intelligence technologies. Use any combination of financial indicators in conjunction with advanced neural networks and genetic algorithms to create remarkably effective end-of-day or real-time trading models for stocks, futures and forex. Included is a free Solution Service, which includes 10 neural network models.

JOpt.SDK is a route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

NeuralPower is a general, integrated, easiest-to-use, powerful and unmatched MLP Artificial Neural Network (ANN) program. It can be used in almost all study fields such as multi-nonlinear regression, forecasting, curve fit, pattern recognition, decision making and problem optimization, time series analysis and market predictions.

Features:

1. Any more layer numbers, any more node numbers of each layer and any transfer functions of each layer.
2. Visual design of network structures.
3. Visual, real time and dynamic control of learning process.
4: Can use multi-learning files with normal and grid data types.
5: Five learning algorithms, including genetic algorithms and Levnberg-Marquardt Algorithm. Fast converge of the learning can be easily achieved.
6: One-click settlement for time series analysis.
7: Steps-by-steps learning run mode.
8: Optimal analysis of inter-relationships and 2D-3D graphical evaluations of all factors.
10: Excel-like, MDI data file editor enhanced by VB, Java and Delphi/Pascal script languages. Input/export Excel (.xls), Lotus 1-2-3 (.wk1, .wks), QuarttorPro (.wq1), DBase File (.dbf), Access File (.mdb) and Comma-delimited Text File (.csv;.txt) directly.
11: Chart Function: create, edit, and store multi-charts within a single data file.
12: Linear, multi-linear regression with over 30 pre-defined functions.
13: Function/Equation fit (curve fit): fit any type of equation according to your data. No limitations on variables and parameters number
14: Equation solve: solve any type of equation or system equations by evolution algorithms (Genetic Algorithm, Particle Swarm Optimization and Rotation Inherit Optimization)
15: Matrix operation, data arrange tools, and much more...
...
and much more

JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

A.I. Solver Studio is a unique pattern recognition application that deals with finding optimal solutions to classification problems and uses several powerful and proven artificial intelligence techniques including neural networks, genetic programming and genetic algorithms. No special knowledge is required of users as A.I. Solver Studio manages all the complexities of the problem solving internally. This leaves users free to concentrate on formulating their problems of interest.Typically, all that is required of users is that they formulate their problems by creating training data and test data. A.I. Solver Studio is capable of reading virtually any kind delimited text file format where each line represents one data item. By testing solutions on testing data after each training iteration users have clear picture of how their solution performs in real world scenarios at any given time and can use this data to decide when a solution is good enough for their needs.

FindDec is a software for search of global and local optimums at system of functions with genetic algorithm. FindDec is available in three versions: Standard, Professional, and Unlimited. The number of variables in the FindDec professional must be no more than 150. FindDec solves maximum/minimum optimization problem in finance, distribution, scheduling, resource allocation, manufacturing, budgeting, engineering, and more. FindDec can find optimal solutions to problems which are "unsolvable" for standard linear and non-linear optimizers. FindDec can find optimal solutions to virtually any type of problem, from the simple to the most complex.

FindDec is useful and efficient when
* the method of an accurate decision does not know
* the method of an accurate decision knows, but it is very difficult to implement
* the exact optimum is not required, and the decision may be any value, which is more a set value
* the search space is large, complex or poorly understood
* traditional search methods fail

Work consists of six steps in the application FindDec
1. Input of the optimization problem
2. Option of parameters of genetic algorithm
3. Option of termination conditions of genetic algorithm
4. Option of output and saving
5. Searching of decisions
6. Saving of a result
Steps 1, 5, 6 are compulsory.

Requirements: 64 Mb Ram

FindDec is a software for search of global and local optimums at system of functions with genetic algorithm. FindDec is available in three versions: Standard, Professional, and Unlimited. The number of variables in the FindDec standard must be no more than 70. FindDec solves maximum/minimum optimization problem in finance, distribution, scheduling, resource allocation, manufacturing, budgeting, engineering, and more. FindDec can find optimal solutions to problems which are "unsolvable" for standard linear and non-linear optimizers. FindDec can find optimal solutions to virtually any type of problem, from the simple to the most complex.

FindDec is useful and efficient when
* the method of an accurate decision does not know
* the method of an accurate decision knows, but it is very difficult to implement
* the exact optimum is not required, and the decision may be any value, which is more a set value
* the search space is large, complex or poorly understood
* traditional search methods fail

Work consists of six steps in the application FindDec
1. Input of the optimization problem
2. Option of parameters of genetic algorithm
3. Option of termination conditions of genetic algorithm
4. Option of output and saving
5. Searching of decisions
6. Saving of a result
Steps 1, 5, 6 are compulsory.

Requirements: 64 Mb Ram

FindDec is a software for search of global and local optimums at system of functions with genetic algorithm. FindDec is available in three versions: Standard, Professional, and Unlimited. The number of variables in the FindDec Unlimited is not limited. FindDec solves maximum/minimum optimization problem in finance, distribution, scheduling, resource allocation, manufacturing, budgeting, engineering, and more. FindDec can find optimal solutions to problems which are "unsolvable" for standard linear and non-linear optimizers. FindDec can find optimal solutions to virtually any type of problem, from the simple to the most complex.

FindDec is useful and efficient when
* the method of an accurate decision does not know
* the method of an accurate decision knows, but it is very difficult to implement
* the exact optimum is not required, and the decision may be any value, which is more a set value
* the search space is large, complex or poorly understood
* traditional search methods fail

Work consists of six steps in the application FindDec
1. Input of the optimization problem
2. Option of parameters of genetic algorithm
3. Option of termination conditions of genetic algorithm
4. Option of output and saving
5. Searching of decisions
6. Saving of a result
Steps 1, 5, 6 are compulsory.

Requirements: 64 Mb Ram