Parallel memetic algorithms for solving large scale combinatorial optimization problems
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 mathemati...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Published: |
2008
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/3496 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Summary: | 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. |
|---|