A Memetic PSO-Based Algorithm for Solving CombinatorialOptimization Problem and Global Optimization

博士 === 國立成功大學 === 電腦與通信工程研究所 === 103 === Recently, combinatorial optimization problems have received increasing attention within the NP-hard optimization research community. For large NP-hard combinatorial optimization problems, traditional algorithms such as greedy or dynamic programming do not obt...

Full description

Bibliographic Details
Main Authors: Ko-WeiHuang, 黃科瑋
Other Authors: Chu-Sing Yang
Format: Others
Language:en_US
Published: 2015
Online Access:http://ndltd.ncl.edu.tw/handle/61189357104211992626