## Simple Genetic Algorithm scripts

#### Open Traveling Salesman Problem Genetic Algorithm

The difference to the classic TSP is that the salesman doesn't travel in loop across the circuit. Requirements: · MATLAB 7.6 or higher ...
Matlab

#### Fixed Start Open Traveling Salesman Problem Genetic Algorithm

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: · MATLAB 7.6 or higher ...
Matlab

#### Charlemagne

Charlemagne is a genetic programming application which aims to be highly configurable and applicable to a broad range of problems.It is written in Python and Lisp and to some degree is extensible in both languages. It features built-in input-output mapping support, but also provides the ability to define complex fitness ...
Python

#### Fixed Endpoints Open Multiple Traveling Salesmen Problem Genetic Algorithm

The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the ...
Matlab

#### Multiple Variable Traveling Salesmen Problem Genetic Algorithm

It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). Each salesman ...
Matlab

#### Fixed Start End Point Multiple Traveling Salesmen Problem Genetic Algorithm

Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and ...
Matlab

#### Fixed Start Open Multiple Traveling Salesmen Problem Genetic Algorithm

Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities without returning to the starting location).Each salesman starts at the first point, ...
Matlab

#### GODLIKE

... optimization problems using relatively basic implementations of a genetic algorithm, differential evolution, particle swarm optimization and adaptive simulated annealing algorithms.The script is primarily intended to increase robustness, not ... requires more function evaluations than any of the algorithms separately. Requirements: · MATLAB 7.7 or higher ...
Matlab

#### Fityk

... line interface), variouse optimization methods (standard Marquardt least-square algorithm, Genetic Algorithms, Nelder-Mead simplex), equality constraints, modelling error of x coordinate of ...
C/C++