METAMORPHIC BIO-INSPIRED MODEL FOR OPTIMIZING SOFT CONSTRAINED COMBINATORIAL PROBLEMS

Main Article Content

Article Sidebar

PDF
Published Oct 13, 2013
M. Nandhini*, S. Kanmani

Abstract

This paper establishes a new metamorphic bio-inspired model to optimize soft constrained combinatorial problems. It is based on improved genetic algorithm (GA) and local search of steepest ascent hill climbing algorithm(SAHC). The performance of GA can be improved by proposing new selection, crossover and mutation operators and thus forming twelve improved GA models with various combinations of GA operators. Empirical study has been done on instances of college course timetabling problems (CCTP) and benchmark problems of multi job shop scheduling(MJSSP) problems and formed 12 models with various combinations of GA operators (proposed and existing) for solving soft constrained combinatorial problems and identified the best to solve the soft constrained combinatorial problems.
Abstract 121 | PDF Downloads 111

Article Details

Issue
Vol 2 No 11 (2012): Asian Journal of Computer Science and Information Technology
Section
Articles

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”