My Account Log in

1 option

Evolutionary Computation in Combinatorial Optimization : 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings / edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Chicano, Francisco, Editor.
Hu, Bin, Editor.
García Sánchez, Pablo, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9595
Theoretical Computer Science and General Issues, 2512-2029 ; 9595
Language:
English
Subjects (All):
Numerical analysis.
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Computer science.
Artificial intelligence.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Theory of Computation.
Artificial Intelligence.
Local Subjects:
Numerical Analysis.
Algorithms.
Discrete Mathematics in Computer Science.
Theory of Computation.
Artificial Intelligence.
Physical Description:
1 online resource (XII, 267 pages) : 59 illustrations, 1 illustrations in color.
Edition:
1st ed. 2016.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2016.
System Details:
text file PDF
Summary:
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 presented were carefully reviewed and selected from 44 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic algorithms, variable neighborhood search, particle swarm optimization, hyperheuristics, mat-heuristic and other adaptive approaches. Applications included both traditional domains, such as graph coloring, vehicle routing, the longest common subsequence problem, the quadratic assignment problem; and new(er) domains such as the traveling thief problem, web service location, and finding short addition chains. The theoretical studies involved fitness landscape analysis, local search and recombination operator analysis, and the big valley search space hypothesis. The consideration of multiple objectives, dynamic and noisy environments was also present in a number of articles.
Contents:
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 and 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. .
Other Format:
Printed edition:
ISBN:
978-3-319-30698-8
9783319306988
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account