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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 136. Bestandsnummer des Verkäufers 26128169590
Anzahl: 4 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 136 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Bestandsnummer des Verkäufers 131336617
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 136. Bestandsnummer des Verkäufers 18128169596
Anzahl: 4 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Enhanced GA & LS for Optimizing Soft Constrained Combinatorial Problems | Enhanced Genetic Algorithm with Local Search for Optimizing Soft Constrained Combinatorial Problems | M. Nandhini (u. a.) | Taschenbuch | Englisch | Scholar's Press | EAN 9783639710816 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 105227415
Anzahl: 5 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9783639710816
Anzahl: 2 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
paperback. Zustand: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA82936397108196
Anzahl: 1 verfügbar