جهت دسترسی به کاربرگه ی زیر، از این لینک استفاده کنید.
|Title:||Evolutionary Computation in Combinatorial Optimization;15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings|
|Keywords:||Computer Science;Computer software.;Electronic data processing.;Computational complexity.;Artificial intelligence;Computer Science;Numeric Computing.;Algorithm Analysis and Problem Complexity.;Discrete Mathematics in Computer Science.;Computation by Ab;518;QA297-299.4|
|Publisher:||Springer International Publishing :.;Imprint: Springer,|
|Series/Report no.:||Lecture Notes in Computer Science, 0302-9743 9026.;Lecture Notes in Computer Science, 0302-9743 9026.|
|Abstract:||This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.|
|Description:||Printed edition: 9783319164670.|
|Table Of Contents:||A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem -- A Computational Comparison of Different Algorithms for Very Large p-median Problems -- A New Solution Representation for the Firefighter Problem -- A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem -- A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands -- An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows -- Analysis of Solution Quality of a Multi objective Optimization-Based Evolutionary Algorithm for Knapsack Problem -- Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization -- Hyper-heuristic Operator Selection and Acceptance Criteria -- Improving the Performance of the Germinal Center Artificial Immune System Using خµ-Dominance: A Multi-objective Knapsack Problem -- Mixing Network Extremal Optimization for Community Structure Detection -- Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogeneous Electric Vehicles -- On the Complexity of Searching the Linear Ordering Problem Neighborhoods -- Runtime Analysis of (1 + 1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on ONEMAX+ZEROMAX Problem -- The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity -- The Sim-EA Algorithm with Operator Auto adaptation for the Multi objective Firefighter Problem -- True Pareto Fronts for Multi-objective AI Planning Instances -- Upper and Lower Bounds on Unrestricted Black-Box Complexity of JUMPn,l -- Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling.|
|Type Of Material:||Latin Book|
|Appears in Collections:||Mathematics Ebook|
Files in This Item:
|9783319164687.pdf||12.49 MB||Adobe PDF|
Download Request a copy
تمامی کاربرگه ها در کتابخانه ی دیجیتال حنان به صورت کامل محافظت می شوند.