Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Evolutionary computation in combinatorial optimization : 8th European conference, EcoCOP 2008, Naples, Italy, March 26-28, 2008 : proceedings / / Jano van Hemert, Carlos Cotta (eds.)
| Evolutionary computation in combinatorial optimization : 8th European conference, EcoCOP 2008, Naples, Italy, March 26-28, 2008 : proceedings / / Jano van Hemert, Carlos Cotta (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2008 |
| Descrizione fisica | 1 online resource (XII, 292 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
Van HemertJano
CottaCarlos |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Evolutionary programming (Computer science)
Evolutionary computation Combinatorial optimization - Data processing Genetic algorithms |
| ISBN | 3-540-78604-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Local Search Algorithms for the Genomic Median Problem -- Solving Graph Coloring Problems Using Learning Automata. |
| Altri titoli varianti | EvoCOP 2008 |
| Record Nr. | UNINA-9910485049503321 |
| Berlin ; ; New York, : Springer, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings / / edited by Carlos Cotta, Jano van Hemert
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings / / edited by Carlos Cotta, Jano van Hemert |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (250 p.) |
| Disciplina | 006.3823 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Theory of Computation Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-85348-4
9786610853489 3-540-71615-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A New Local Search Algorithm for the DNA Fragment Assembly Problem -- A Hybrid Immune-Based System for the Protein Folding Problem -- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags -- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem -- Genetic Algorithms for Word Problems in Partially Commutative Groups -- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling -- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges -- Iterated k-Opt Local Search for the Maximum Clique Problem -- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem -- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks -- A New Metaheuristic for the Vehicle Routing Problem with Split Demands -- Generation of Tree Decompositions by Iterated Local Search -- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem -- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms -- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem -- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem -- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling -- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics -- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem -- A Hybrid Method for Solving Large-Scale Supply Chain Problems -- Crossover Operators for the Car Sequencing Problem. |
| Record Nr. | UNISA-996465842403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization : 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings / / edited by Carlos Cotta, Jano van Hemert
| Evolutionary Computation in Combinatorial Optimization : 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings / / edited by Carlos Cotta, Jano van Hemert |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (250 p.) |
| Disciplina | 006.3823 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Theory of Computation Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-85348-4
9786610853489 3-540-71615-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A New Local Search Algorithm for the DNA Fragment Assembly Problem -- A Hybrid Immune-Based System for the Protein Folding Problem -- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags -- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem -- Genetic Algorithms for Word Problems in Partially Commutative Groups -- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling -- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges -- Iterated k-Opt Local Search for the Maximum Clique Problem -- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem -- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks -- A New Metaheuristic for the Vehicle Routing Problem with Split Demands -- Generation of Tree Decompositions by Iterated Local Search -- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem -- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms -- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem -- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem -- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling -- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics -- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem -- A Hybrid Method for Solving Large-Scale Supply Chain Problems -- Crossover Operators for the Car Sequencing Problem. |
| Record Nr. | UNINA-9910484803003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||