An hybrid heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS

Abstract

A machine loading problem in flexible manufacturing system (FMS) is discussed with bicriterion objectives of minimizing system unbalance and maximizing system throughput in the occurrence of technological constraints such as available machining time and tool slots. An efficient evolutionary algorithm by hybridizing the genetic algorithm (GA) and simulated annealing (SA) algorithm called GASA is proposed in this paper. The performance of the GASA is tested by using 10 sample dataset and the results are compared with the heuristics reported in the literature. Two machine selection heuristics are proposed and their influence on the quality of the solution is also studied. Extensive computational experiments have been carried out to evaluate the performance of the proposed evolutionary heuristics and the results are presented in tables and figures. The results clearly support the better performance of GASA over the algorithms reported in the literature.

DOI: 10.1109/COASE.2007.4341779

13 Figures and Tables

Cite this paper

@article{Yogeswaran2007AnHH, title={An hybrid heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS}, author={Mohan Yogeswaran and S. G. Ponnambalam and Manoj Kumar Tiwari}, journal={2007 IEEE International Conference on Automation Science and Engineering}, year={2007}, pages={182-187} }