Improving Initial Population for Genetic Algorithm using the Multi Linear Regression Based Technique (MLRBT)
Genetic algorithms (GAs) are powerful heuristic search techniques that are used successfully to solve problems for many different applications. Seeding the initial population is considered as the first step of the GAs.
In this work, a new method is proposed, for the initial population seeding called the Multi Linear Regression Based Technique (MLRBT). That method divides a given large scale TSP problem into smaller sub-problems and the technique works frequently until the sub-problem size is very small, four cities or less. Experiments were carried out using the well-known Travelling Salesman Problem (TSP) instances and they showed promising results in improving the GAs' performance to solve the TSP.