A comparative study of metaheuristic algorithms for the fertilizer optimization problem
Hard combinatorial optimization (CO) problems pose challenges to traditional algorithmic solutions. The search space usually contains a large number of local optimal points and the computational cost to reach a global optimum may be too high for practical use. In this work, we conduct a comparative...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en |
Published: |
University of Saskatchewan
2006
|
Subjects: | |
Online Access: | http://library.usask.ca/theses/available/etd-08302006-152221/ |