Develop an evolutionary-based block model for combinatorial optimization
博士 === 元智大學 === 資訊管理學系 === 103 === Combinatorial optimization is widely used in assignment problem, traveling salesman problem (TSP), scheduling problems and et al. There are lots of researches applying evolutionary algorithms (EAs) to solve this kind of problems. In this study, we apply an evolutio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/8845x3 |