Verkauf durch Sack Fachmedien

Chicano / Hu / García-Sánchez

Evolutionary Computation in Combinatorial Optimization

16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings

Medium: Buch
ISBN: 978-3-319-30697-1
Verlag: Springer
Erscheinungstermin: 16.03.2016
Lieferfrist: bis zu 10 Tage

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.


Produkteigenschaften


  • Artikelnummer: 9783319306971
  • Medium: Buch
  • ISBN: 978-3-319-30697-1
  • Verlag: Springer
  • Erscheinungstermin: 16.03.2016
  • Sprache(n): Englisch
  • Auflage: 1. Auflage 2016
  • Serie: Theoretical Computer Science and General Issues
  • Produktform: Kartoniert, Paperback
  • Gewicht: 4277 g
  • Seiten: 267
  • Format (B x H x T): 155 x 235 x 16 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

A Hybrid Constructive Mat-Heuristic Algorithmfor The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up andDelivery.- A Property Preserving Method for Extending a Single-Objective ProblemInstance to Multiple Objectives with Specific Correlations.- An EvolutionaryApproach to the Full Optimization of the Traveling Thief Problem.- Construct,Merge, Solve & Adapt: Application to the Repetition-Free Longest CommonSubsequence Problem.- Deconstructing the Big Valley Search Space Hypothesis.- Determiningthe Difficulty of Landscapes by PageRank Centrality in Local Optima Networks.- EfficientHill Climber for Multi-Objective Pseudo-Boolean Optimization.- EvaluatingHyperheuristics and Local Search Operators for Periodic Routing Problems.- EvolutionaryAlgorithms for Finding Short Addition Chains: Going the Distance.- ExperimentalEvaluation of Two Approaches to Optimal Recombination for PermutationProblems.- Hyperplane Elimination for Quickly Enumerating Local Optima.- Limitsto Learning in Reinforcement Learning Hyperheuristics.- Modifying Colouringsbetween Time-Steps to Tackle Changes in Dynamic Random Graphs.- Particle SwarmOptimisation with Sequence-Like Indirect Representation for Web ServiceComposition.- Particle Swarm Optimization for Multi-Objective Web ServiceLocation Allocation.- Sim-EDA: A Multipopulation Estimation of Distribution AlgorithmBased on Problem Similarity.- Solving the Quadratic Assignment Problem withCooperative Parallel Extremal Optimization.