A General Framework of Relation-based Genetic Algorithms for Set Partitioning Problems with Constraint Handling
博士 === 國立中央大學 === 資訊管理研究所 === 96 === Set partitioning problems’ (SPPs) plural nature makes them essentially individual problem specific, with various informative information and specific hard constraints in each occasion, and therefore SPPs do not have any general framework to serve as an integrated...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99402135895811586515 |