Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13224
Title: Metaheuristics for NP-hard combinatorial optimization problems
Authors: DINH TRUNG HOANG
Keywords: Metaheuristics; NP-hard combinatorial optimization; decomposition; ant colony optimization
Issue Date: 25-Mar-2008
Source: DINH TRUNG HOANG (2008-03-25). Metaheuristics for NP-hard combinatorial optimization problems. ScholarBank@NUS Repository.
Abstract: In one part of this work, we studied how decomposition-based search methods can improve running time performance when solving very large optimization instances. In another part of the work, carried out a theoretical analysis on convergence properties of Graph-based Ant System and derived a method that can, with deployment of local search, improve performance of Ant System to solve Traveling Salesman Problem.
URI: http://scholarbank.nus.edu.sg/handle/10635/13224
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Dinh Trung Hoang_PhD_ECE Dept_Metaheuristics For NP-hard Combinatorial Optimzation Problem_2008.pdf873.37 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

290
checked on Dec 11, 2017

Download(s)

240
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.