Evolutionary computation in combinatorial optimization : 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings /: 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings. (2015)

• Record Type: Book
• Other Titles: EvoCOP 2015
• Further Information: Note: Gabriela Ochoa, Francisco Chicano (eds).
• Editors: Ochoa, Gabriela; Chicano, Francisco
• Other Names: EvoCOP (Conference), 15th
• 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 f-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.
• Publisher Details: Cham : Springer
• Publication Date: 2015
• Extent: 1 online resource (xii, 235 pages), illustrations
• Subjects: 005.1; Computer science; Evolutionary computation -- Congresses; Combinatorial optimization -- Data processing -- Congresses; Evolutionary programming (Computer science) -- Congresses; Combinatorial optimization -- Data processing; Evolutionary computation; Evolutionary programming (Computer science); Engineering & Applied Sciences; Applied Mathematics; Computers -- Programming -- Algorithms; Computers -- Data Processing; Computers -- Machine Theory; Computers -- Intelligence (AI) & Semantics; Algorithms & data structures; Discrete mathematics; User interface design & usability; Artificial intelligence; Electronic data processing; Computer software; Computational complexity; Artificial intelligence; Mathematical theory of computation; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319164687; 3319164686; 3319164678; 9783319164670
• Related ISBNs: 9783319164670
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed March 19, 2015).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.