Evolutionary Computation in Combinatorial Optimization: 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers: Lecture Notes in Computer Science, cartea 8600
Editat de Christian Blum, Gabriela Ochoaen Limba Engleză Paperback – 28 aug 2014
The 20 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers cover the following topics: swarm intelligence algorithms, fitness landscapes and adaptive algorithms, real world and routing problems and cooperative and metaheuristic search.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 385.84 lei
Nou
Puncte Express: 579
Preț estimativ în valută:
73.84€ • 76.62$ • 61.72£
73.84€ • 76.62$ • 61.72£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662443194
ISBN-10: 3662443198
Pagini: 253
Ilustrații: XII, 241 p. 62 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.36 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662443198
Pagini: 253
Ilustrații: XII, 241 p. 62 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.36 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem.- A Parametric Framework for Cooperative Parallel Local Search.- A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube.- An Analysis of Parameters of irace.- An Improved Multi-objective Algorithm for the Urban Transit Routing Problem.- An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments.- Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case.- Cooperative Selection: Improving Tournament Selection via Altruism.- Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem.- Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance.- Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem.- Gaussian Based Particle Swarm Optimisation and Statistical Clustering for Feature Selection Global Optimization of Multimodal Deceptive Functions.- Learning Inherent Networks from Stochastic Search Methods.- Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders.- Modeling an Artificial Bee Colony with Inspector for Clustering Tasks.- Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach.- Phase Transition and Landscape Properties of the Number Partitioning Problem.- The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms.- The Influence of Correlated Objectives on Different Types of P-ACO Algorithms.
A Parametric Framework for Cooperative Parallel Local Search.- A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube.- An Analysis of Parameters of irace.- An Improved Multi-objective Algorithm for the Urban Transit Routing Problem.- An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments.- Balancing Bicycle Sharing Systems: AnApproach for the Dynamic Case.- Cooperative Selection: Improving Tournament Selection via Altruism.- Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem.- Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance.- Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem.- Gaussian Based Particle Swarm Optimisation and Statistical Clustering for Feature Selection Global Optimization of Multimodal Deceptive Functions.- Learning Inherent Networks from Stochastic Search Methods.- Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders.- Modeling an Artificial Bee Colony with Inspector for Clustering Tasks.- Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach.- Phase Transition and Landscape Properties of the Number Partitioning Problem.- The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms.- The Influence of Correlated Objectives on Different Types of P-ACO Algorithms.
A Parametric Framework for Cooperative Parallel Local Search.- A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube.- An Analysis of Parameters of irace.- An Improved Multi-objective Algorithm for the Urban Transit Routing Problem.- An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments.- Balancing Bicycle Sharing Systems: AnApproach for the Dynamic Case.- Cooperative Selection: Improving Tournament Selection via Altruism.- Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem.- Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance.- Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem.- Gaussian Based Particle Swarm Optimisation and Statistical Clustering for Feature Selection Global Optimization of Multimodal Deceptive Functions.- Learning Inherent Networks from Stochastic Search Methods.- Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders.- Modeling an Artificial Bee Colony with Inspector for Clustering Tasks.- Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach.- Phase Transition and Landscape Properties of the Number Partitioning Problem.- The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms.- The Influence of Correlated Objectives on Different Types of P-ACO Algorithms.