Distributed GAs with case-based initial populations for real-time solution of combinatorial problems


Combinatorial problems are NP-complete, which means even infinite number of CPUs take polynomial time to search an optimal solution. Therefore approximate search algorithms such as Genetic Algorithms are used. However, such an approximate search algorithm easily falls into local optimum and just distributed / parallel processing seems inefficient. In this… (More)
DOI: 10.1109/EALS.2014.7009509


2 Figures and Tables