Optimal solution of linear machine layout problem using ant colony system

  • Authors:
  • Fountas Chrysostomos;Aristidis Vlachos

  • Affiliations:
  • Department of Informatics, University of Piraeus, Piraeus, Greece;Department of Informatics, University of Piraeus, Piraeus, Greece

  • Venue:
  • ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper examines the analysis for the production of units (objects) with the lowest possible cost, which is the most important goal for many manufacturing companies. We use the linear programming model for minimal backward-flow, to determine the optimal linear machine sequence in a manufacturing cell. We apply a modified ACS algorithm, based on the conditions and parameters for the linear machine layout problem, which is a difficult Combinatorial Optimization Problem. Computational results demonstrate that ACS is an effective meta-heuristic algorithm for the linear machine layout problem.