Language: en
Pages: 404
Pages: 404
The application of sophisticated evolutionary computing approaches for solving complex problems with multiple conflicting objectives in science and engineering have increased steadily in the recent years. Within this growing trend, Memetic algorithms are, perhaps, one of the most successful stories, having demonstrated better efficacy in dealing with multi-objective problems as
Language: en
Pages: 370
Pages: 370
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems. The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes. “Handbook
Language: en
Pages: 1005
Pages: 1005
This two-volume handbook presents a collection of novel methodologies with applications and illustrative examples in the areas of data-driven computational social sciences. Throughout this handbook, the focus is kept specifically on business and consumer-oriented applications with interesting sections ranging from clustering and network analysis, meta-analytics, memetic algorithms, machine learning, recommender
Language: en
Pages: 1026
Pages: 1026
This handbook is an endeavour to cover many current, relevant, and essential topics related to decision sciences in a scientific manner. Using this handbook, graduate students, researchers, as well as practitioners from engineering, statistics, sociology, economics, etc. will find a new and refreshing paradigm shift as to how these topics
Language: en
Pages: 21
Pages: 21
Process planning and scheduling are two crucial components in a flexible manufacturing system. Lots of novel meta-heuristics have been applied to the integrated process planning and scheduling (IPPS) problem for an efficient utilization of manufacturing resources; nevertheless, the tricky part in real life stems from the uncertainty in processing times.