Evolutionary Computation in Combinatorial Optimization (eBook, PDF)
8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, Proceedings
Redaktion: Hemert, Jano van; Cotta, Carlos
40,95 €
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
40,95 €
Als Download kaufen
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
20 °P sammeln
Evolutionary Computation in Combinatorial Optimization (eBook, PDF)
8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, Proceedings
Redaktion: Hemert, Jano van; Cotta, Carlos
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
Coverage in this proceedings volume presents the latest research and details current developments and applications in metaheuristics, a paradigm to effectively solve difficult combinatorial optimization problems in industry, economics, and science.
- Geräte: PC
- ohne Kopierschutz
- eBook Hilfe
- Größe: 5.88MB
Coverage in this proceedings volume presents the latest research and details current developments and applications in metaheuristics, a paradigm to effectively solve difficult combinatorial optimization problems in industry, economics, and science.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Springer Berlin Heidelberg
- Seitenzahl: 292
- Erscheinungstermin: 3. April 2008
- Englisch
- ISBN-13: 9783540786047
- Artikelnr.: 44222660
- Verlag: Springer Berlin Heidelberg
- Seitenzahl: 292
- Erscheinungstermin: 3. April 2008
- Englisch
- ISBN-13: 9783540786047
- Artikelnr.: 44222660
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
Adaptive Tabu Tenure Computation in Local Search.- A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems.- Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem.- Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.- Efficient Local Search Limitation Strategies for Vehicle Routing Problems.- Evolutionary Local Search for the Minimum Energy Broadcast Problem.- Exploring Multi-objective PSO and GRASP-PR for Rule Induction.- An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem.- Graph Colouring Heuristics Guided by Higher Order Graph Properties.- A Hybrid Column Generation Approach for the Berth Allocation Problem.- Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem.- An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.- An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem.- Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.- Improving Metaheuristic Performance by Evolving a Variable Fitness Function.- Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach.- Inc*: An Incremental Approach for Improving Local Search Heuristics.- Metaheuristics for the Bi-objective Ring Star Problem.- Multiobjective Prototype Optimization with Evolved Improvement Steps.- Optimising Multiple Kernels for SVM by Genetic Programming.- Optimization of Menu Layouts by Means of Genetic Algorithms.- A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.- Reactive Stochastic LocalSearch Algorithms for the Genomic Median Problem.- Solving Graph Coloring Problems Using Learning Automata.
Adaptive Tabu Tenure Computation in Local Search.- A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems.- Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem.- Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.- Efficient Local Search Limitation Strategies for Vehicle Routing Problems.- Evolutionary Local Search for the Minimum Energy Broadcast Problem.- Exploring Multi-objective PSO and GRASP-PR for Rule Induction.- An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem.- Graph Colouring Heuristics Guided by Higher Order Graph Properties.- A Hybrid Column Generation Approach for the Berth Allocation Problem.- Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem.- An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.- An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem.- Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.- Improving Metaheuristic Performance by Evolving a Variable Fitness Function.- Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach.- Inc*: An Incremental Approach for Improving Local Search Heuristics.- Metaheuristics for the Bi-objective Ring Star Problem.- Multiobjective Prototype Optimization with Evolved Improvement Steps.- Optimising Multiple Kernels for SVM by Genetic Programming.- Optimization of Menu Layouts by Means of Genetic Algorithms.- A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.- Reactive Stochastic LocalSearch Algorithms for the Genomic Median Problem.- Solving Graph Coloring Problems Using Learning Automata.