Evolutionary Computation in Combinatorial Optimization 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 – April 1, 2016, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Chicano, Francisco (Επιμελητής έκδοσης), Hu, Bin (Επιμελητής έκδοσης), García-Sánchez, Pablo (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
• Έκδοση: 1st ed. 2016.
• Σειρά: Lecture Notes in Computer Science, 9595
• Θέματα: Computer science.; Computers.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Artificial intelligence.; Computer Science.; Numeric Computing.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Computation by Abstract Devices.; Artificial Intelligence (incl. Robotics).

This book constitutes the refereed proceedings of the 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, held in Porto, Portugal, in March/April 2016, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 17 revised full papers p...

Πίνακας περιεχομένων:

• A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery
• A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations
• An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem
• Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem
• Deconstructing the Big Valley Search Space Hypothesis
• Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks
• Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization
• Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems
• Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance
• Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems
• Hyperplane Elimination for Quickly Enumerating Local Optima
• Limits to Learning in Reinforcement Learning Hyperheuristics
• Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs
• Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition
• Particle Swarm Optimization for Multi-Objective Web Service Location Allocation
• Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity
• Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. .