Enhanced GA & LS for Optimizing Soft Constrained Combinatorial Problems

Enhanced GA & LS for Optimizing Soft Constrained Combinatorial Problems


Marketed By :  Scholars' Press   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 5,059

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

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.

Product Specifications
SKU :COC75393
Country of ManufactureIndia
Product BrandScholars' Press
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08
0 Review(s)