dc.contributor.authorTang, Jing.en_US
dc.date.accessioned2008-09-17T09:31:03Z
dc.date.available2008-09-17T09:31:03Z
dc.date.copyright2008en_US
dc.date.issued2008
dc.identifier.citationTang, J. (2008). Parallel memetic algorithms for solving large scale combinatorial optimization problems. Doctoral thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/3496
dc.description.abstractAlthough 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.en_US
dc.rightsNanyang Technological Universityen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
dc.titleParallel memetic algorithms for solving large scale combinatorial optimization problemsen_US
dc.typeThesisen_US
dc.contributor.supervisorLim, Meng Hioten_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeDOCTOR OF PHILOSOPHY (EEE)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record