Ant colony optimisation for machine layout problems

Ant colony optimisation for machine layout problems

0.00 Avg rating0 Votes
Article ID: iaor20043457
Country: Netherlands
Volume: 28
Issue: 3
Start Page Number: 287
End Page Number: 310
Publication Date: Sep 2004
Journal: Computational Optimization and Applications
Authors: ,
Keywords: heuristics, programming: integer
Abstract:

Flexible machine layout problems describe the dynamic arrangement of machines to optimise the trade-off between material handling and rearrangement costs under changing and uncertain production environments. A previous study used integer-programming techniques to solve heuristically reduced versions of the problem. As an alternative, this paper introduces an ant colony optimisation (ACO) algorithm to generate good solutions. Experimental results are presented, with ACO obtaining better solutions than the reduction heuristic.

Reviews

Required fields are marked *. Your email address will not be published.