Ant colony optimisation has traditionally been used to solve problems that have few/light constraints or no constraints at all. Algorithms to maintain and restore feasibility have been successfully applied to such problems. Set partitioning is a very constrained combinatorial optimisation problem, for which even feasible solutions are difficult to construct. In this paper a binary ant colony optimisation framework is applied to this problem. To increase its effectiveness, feasibility restoration, solution improvement algorithms and candidate set strategies are added. These algorithms can be applied to complete solution vectors and as such can be used by any solver. Moreover, the principles of the support algorithms may be applied to other constrained problems. The overall results indicate that the ant colony optimisation algorithm can efficiently solve small to medium sized problems. It is envisaged that in future research parallel computation could be used to simultaneouly reduce solver time while increasing solution quality.
|Title of host publication||Proceedings - 6th IEEE International Conference on e-Science Workshops, e-ScienceW 2010|
|Number of pages||7|
|Publication status||Published - 2010|
|Event||6th IEEE International Conference on e-Science Workshops, e-ScienceW 2010 - Brisbane, QLD, Australia|
Duration: 7 Dec 2010 → 10 Dec 2010
|Conference||6th IEEE International Conference on e-Science Workshops, e-ScienceW 2010|
|Period||7/12/10 → 10/12/10|