Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9595
Editat de Francisco Chicano, Bin Hu, Pablo García-Sánchezen Limba Engleză Paperback – 16 mar 2016
The17 revised full papers presented were carefully reviewed and selected from 44submissions. The papers cover methodology, applications and theoretical studies. Themethods included evolutionary and memetic algorithms, variable neighborhoodsearch, particle swarm optimization, hyperheuristics, mat-heuristic and otheradaptive approaches. Applications included both traditional domains, such asgraph coloring, vehicle routing, the longest common subsequence problem, thequadratic assignment problem; and new(er) domains such as the traveling thiefproblem, web service location, and finding short addition chains. Thetheoretical studies involved fitness landscape analysis, local search and recombinationoperator analysis, and the big valley search space hypothesis. Theconsideration of multiple objectives, dynamic and noisy environments was alsopresent in a number of articles.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 379.42 lei
Nou
Puncte Express: 569
Preț estimativ în valută:
72.61€ • 75.43$ • 60.32£
72.61€ • 75.43$ • 60.32£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319306971
ISBN-10: 3319306979
Pagini: 267
Ilustrații: XII, 267 p. 59 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3319306979
Pagini: 267
Ilustrații: XII, 267 p. 59 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Cuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras