Enhanced GA & LS for Optimizing Soft Constrained Combinatorial Problems: Enhanced Genetic Algorithm with Local Search for Optimizing Soft Constrained Combinatorial Problems

Nandhini, M., Kanmani, S.

ISBN 10: 3639710819 / ISBN 13: 9783639710816

Edité par Scholars* Press, 2014

A propos de cet article

New. N° de réf. du vendeur ERICA82936397108196

Détails bibliographiques

Titre : Enhanced GA & LS for Optimizing Soft ...

Éditeur : Scholars* Press

Date d'édition : 2014

Reliure : paperback

Etat : New

Type de livre : book

A propos de ce titre

Synopsis :

To design a model for optimizing Combinatorial Problems(CPs) with multi objectives and multi soft constrained features, a new domain specific crossover and mutation operators in GA are proposed and are combined and hybridized with local search algorithm namely Steepest Ascent Hill Climbing. This resulted to twelve algorithms to optimize CPs with multi objectives. The performance of these twelve algorithms are analysed on two CPs namely College Course Timetabling Problem (CCTP) and Multi Job Shop Scheduling Problem (MJSSP) with the instances of institution based data set for CCTP and standard benchmark instances of MJSSP. From the analysis of these algorithms, the best combination of hybrid model to optimize multi soft constrained CPs with multi objectives is identified.