- Abstract:
-
The Bin Packing and Cutting Stock Problems are well known NP-hard combinatorial optimisation problems with many applications. A number of evolutionary computation techniques have been applied to these problems, including genetic algorithms and evolutionary strategies. In this work, we investigate the use of Dorigo's Ant Colony Optimisation meta-heuristic to solve Bin Packing and Cutting Stock Problems. We show that the technique works well and can outperform other EC techniques. It is also shown to be quite sensitive to the relative weighing of the heuristic (first fit decreasing) as opposed to pheromone trail information.
- Copyright:
- 2002 by The University of Edinburgh. All Rights Reserved
- The sponsors of this research and the University of Edinburgh are authorised to reproduce and distribute reprints for their purposes notwithstanding any copyright annotation hereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing official policies or endorsements, either express or implied, of the research sponsors or the University of Edinburgh.
- Links To Paper
- No links available
- Bibtex format
- @Misc{EDI-INF-RR-0101,
- author = {
Frederick Ducatelle
and John Levine
},
- title = {Ant Colony Optimisation for Bin Packing and Cutting Stock Problems},
- year = 2002,
- month = {Apr},
- }
|
