Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/3496
Title: Parallel memetic algorithms for solving large scale combinatorial optimization problems
Authors: Tang, Jing
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Issue Date: 2008
Source: Tang, J. (2008). Parallel memetic algorithms for solving large scale combinatorial optimization problems. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: 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.
URI: https://hdl.handle.net/10356/3496
DOI: 10.32657/10356/3496
Rights: Nanyang Technological University
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
EEE-THESES_1352.pdf1.22 MBAdobe PDFThumbnail
View/Open

Page view(s) 50

361
Updated on May 12, 2021

Download(s) 20

121
Updated on May 12, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.