Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The FOGA workshop series aims at advancing our understanding of the working principles behind evolutionary algorithms and related randomized search heuristics. FOGA is the premier event to discuss advances in the theoretical foundations of these algorithms, tools needed to analyze them, and different aspects of comparing algorithms' performance. FOGA XV has welcomed submissions covering the entire spectrum of work, ranging from rigorously derived mathematical results to carefully crafted empirical studies.

Genetic algorithms --- Machine learning --- Combinatorial optimization

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses. .

Dynamic programming. --- Combinatorial optimization. --- Data mining. --- Engineering. --- Artificial intelligence. --- Computational Intelligence. --- Artificial Intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Construction --- Industrial arts --- Technology --- Computational intelligence. --- Intelligence, Computational --- Artificial intelligence --- Soft computing

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed post-conference proceedings of the 6th International Conference on Variable Neighborhood Search, ICVNS 2018, held in Sithonia, Greece, in October 2018. ICVNS 2018 received 49 submissions of which 23 full papers were carefully reviewed and selected. VNS is a metaheuristic based on systematic changes in the neighborhood structure within a search for solving optimization problems and related tasks. The main goal of ICVNS 2018 was to provide a stimulating environment in which researchers coming from various scientific fields could share and discuss their knowledge, expertise, and ideas related to the VNS metaheuristic and its applications.

Electronic data processing. --- Computational complexity. --- Computer software. --- Data structures (Computer scienc. --- Mathematical optimization. --- Numeric Computing. --- Discrete Mathematics in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Data Structures. --- Optimization. --- Data structures (Computer science) --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Software, Computer --- Computer systems --- Complexity, Computational --- Electronic data processing --- Machine theory --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Automation --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Traveling salesman problem --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem --- Numerical analysis. --- Computer science—Mathematics. --- Algorithms. --- Data structures (Computer science). --- Algorism --- Algebra --- Arithmetic --- Foundations --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Numerical Analysis. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Computer science --- Artificial intelligence --- Mathematics. --- Data processing.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed proceedings of the 19th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2019, held as part of Evo* 2019, in Leipzig, Germany, in April 2019, co-located with the Evo* 2019 events EuroGP, EvoMUSART and EvoApplications. The 14 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics to their accurate design and application to both single- and multi-objective combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of metaheuristics core components, the clever design of their search principles, and their careful selection and configuration. Applications cover domains such as scheduling, routing, partitioning and general graph problems.

Electronic data processing. --- Computer software. --- Artificial intelligence. --- Computational complexity. --- Data structures (Computer scienc. --- Numeric Computing. --- Algorithm Analysis and Problem Complexity. --- Artificial Intelligence. --- Discrete Mathematics in Computer Science. --- Data Structures. --- Data structures (Computer science) --- Complexity, Computational --- Electronic data processing --- Machine theory --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Software, Computer --- Computer systems --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Automation --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Evolutionary computation. --- Combinatorial optimization --- Data processing. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Computation, Evolutionary --- Neural networks (Computer science) --- Numerical analysis. --- Algorithms. --- Computer science—Mathematics. --- Data structures (Computer science). --- Algorism --- Algebra --- Arithmetic --- Mathematical analysis --- Foundations --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Numerical Analysis. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis