An implementation of ant colony optimisation for solving cutting stock problem

Title: An implementation of ant colony optimisation for solving cutting stock problem
Creator: Jap, Wendy Japutra; Sutanto, Jofry Hadi; Chiong, Raymond
Relation: 4th IASTED International Conference on Advances in Computer Science and Technology (ACST 2008). Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology (Langkawi, Malaysia 2-4 April, 2008) p. 225-229
Relation: http://www.iasted.org/conferences/pastinfo-605.html
Publisher: ACTA Press
Resource Type: conference paper
Date: 2008
Description: The Cutting Stock Problem (CSP) has gained a lot of attention due to its applicability in many industrial sectors. In this paper, we present an emerging nature-inspired technique, the Ant Colony Optimisation (ACO), for solving CSP. ACO uses artificial pheromone trail as the fundamental method to find new solutions. We conduct experiments with our ACO on the benchmark problems of CSP, and compare the performance of ACO with Evolutionary Programming (EP). While ACO is shown to be a feasible solution for tackling CSP, it is still unable to match EP in terms of accuracy and efficiency in most cases.
Subject: ant colony optimization; cutting stock problem; pheromone trail
Identifier: http://hdl.handle.net/1959.13/1058084
Identifier: uon:16325
Identifier: ISSN:9780889867307
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format