Yalaoui / Talbi / Amodeo | Heuristics for Optimization and Learning | Buch | 978-3-030-58929-5 | sack.de

Buch, Englisch, Band 906, 442 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 852 g

Reihe: Studies in Computational Intelligence

Yalaoui / Talbi / Amodeo

Heuristics for Optimization and Learning

Buch, Englisch, Band 906, 442 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 852 g

Reihe: Studies in Computational Intelligence

ISBN: 978-3-030-58929-5
Verlag: Springer International Publishing


This book is a new contribution aiming to give some last research findings in the field of optimization and computing. This work is in the same field target than our two previous books published: “Recent Developments in Metaheuristics” and “Metaheuristics for Production Systems”, books in Springer Series in Operations Research/Computer Science Interfaces.

The challenge with this work is to gather the main contribution in three fields, optimization technique for production decision, general development for optimization and computing method and wider spread applications.

The number of researches dealing with decision maker tool and optimization method grows very quickly these last years and in a large number of fields. We may be able to read nice and worthy works from research developed in chemical, mechanical, computing, automotive and many other fields.
Yalaoui / Talbi / Amodeo Heuristics for Optimization and Learning jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Process Plan Generation for Recon?gurable Manufacturing Systems: Exact vs Evolutionary-Based Multi-Objective Approaches.- On VNS-GRASP and Iterated Greedy Metaheuristics for Solving Hybrid Flow Shop Scheduling Problem with Uniform Parallel Machines and Sequence Independent Setup Time.- A Variable Block Insertion Heuristic for the Energy-Ef?cient Permutation Flowshop Scheduling with Makespan Criterion.- Solving 0-1 Bi-Objective Multi-Dimensional Knapsack Problems using Binary Genetic Algorithm.- An asynchronous parallel evolutionary algorithm for solving large .instances of the multi-objective QAP.- Learning from Prior Designs for Facility Layout Optimization.- Single-objective Real-parameter Optimization: Enhanced LSHADE-SPACMA Algorithm.- Operations Research at Bulk Terminal: A Parallel Column Generation Approach.- Heuristic solutions for the (a,ß)-k feature set problem.- Generic Support for Precomputation-Based Global Routing Constraints in Local Search Optimization.- Dynamic Simulated Annealing with Adaptive Neighborhood using Hidden Markov Model.- Hybridization of the differential evolution algorithm for continuous multi-objective optimization.- A Steganographic Embedding Scheme Using Improved-PSO Approach.- Algorithms towards the Automated Customer Inquiry Classi?cation.-  An heuristic scheme for a reaction advection diffusion equation.- Stock Market Speculation System Development based on Technico Temporal indicators and Data Mining Tools.- A New Hidden Markov Model Approach for Pheromone Level Exponent Adaptation in Ant Colony System.- A new cut-based genetic algorithm for graph partitioning applied to cell formation.-  Memetic algorithm and evolutionary operators for multi-objective matrix tri-factorization problem.- Quaternion simulated annealing.- A Cooperative Multi-Swarm Particle Swarm Optimizer Based Hidden Markov Model.- Experimental Sensitivity Analysis of Grid-Based Parameter Adaptation Method.-  Auto-Scaling System in Apache Spark Cluster using Model-Based Deep Reinforcement Learning.- Innovation Networks from Inter-Organizational Research Collaborations.- Assessing Film Coef?cients of Microchannel Heat Sinks via Cuckoo Search Algorithm.- One-Class Subject Authentication using Feature Extraction by Grammatical Evolution on Accelerometer Data.- Semantic composition of word-embeddings with genetic programming.- New Approach for Continuous and Discrete Optimization: Optimization by Morphological Filters.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.