Parallel memetic algorithms for solving large scale combinatorial optimization problems
Date of Issue2008
School of Electrical and Electronic Engineering
Although significant development of heuristics for various combinatorial optimization problems has been achieved, the extremely expensive computational overhead to tackle large scale problems is still a challenge in its own right. The solution of these problems requires both improvement in mathematical programming algorithms and the utilization of powerful computational platforms. The studies in this dissertation concentrated on memetic algorithms (MAs), a combination of efficient neighborhood search strategies and evolutionary algorithms.
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Nanyang Technological University