top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings / / edited by Jens Gottlieb, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings / / edited by Jens Gottlieb, Günther R. Raidl
Edizione [1st ed. 2004.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica 1 online resource (X, 240 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Mathematical optimization
Computers
Algorithms
Numerical analysis
Computer science—Mathematics
Combinatorics
Optimization
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Numeric Computing
Discrete Mathematics in Computer Science
ISBN 1-280-30722-6
9786610307227
3-540-24652-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto EvoCOP Contributions -- Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm -- Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms -- Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem -- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem -- AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem -- Scatter Search and Memetic Approaches to the Error Correcting Code Problem -- A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem -- Parallel Ant Systems for the Capacitated Vehicle Routing Problem -- A Hierarchical Social Metaheuristic for the Max-Cut Problem -- On the Structure of Sequential Search: Beyond “No Free Lunch” -- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support – A Case Study -- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems -- Binary Merge Model Representation of the Graph Colouring Problem -- Hardness Prediction for the University Course Timetabling Problem -- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem -- On the Use of Path Relinking for the ? – Hub Median Problem -- Solving a Real-World Glass Cutting Problem -- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic -- Improving Vehicle Routing Using a Customer Waiting Time Colony -- New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms -- Improving Edge Recombination through Alternate Inheritance and Greedy Manner -- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm -- On Search Space Symmetry in Partitioning Problems.
Record Nr. UNINA-9910144200503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings / / edited by Jens Gottlieb, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings / / edited by Jens Gottlieb, Günther R. Raidl
Edizione [1st ed. 2004.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica 1 online resource (X, 240 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Mathematical optimization
Computers
Algorithms
Numerical analysis
Computer science—Mathematics
Combinatorics
Optimization
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Numeric Computing
Discrete Mathematics in Computer Science
ISBN 1-280-30722-6
9786610307227
3-540-24652-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto EvoCOP Contributions -- Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm -- Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms -- Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem -- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem -- AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem -- Scatter Search and Memetic Approaches to the Error Correcting Code Problem -- A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem -- Parallel Ant Systems for the Capacitated Vehicle Routing Problem -- A Hierarchical Social Metaheuristic for the Max-Cut Problem -- On the Structure of Sequential Search: Beyond “No Free Lunch” -- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support – A Case Study -- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems -- Binary Merge Model Representation of the Graph Colouring Problem -- Hardness Prediction for the University Course Timetabling Problem -- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem -- On the Use of Path Relinking for the ? – Hub Median Problem -- Solving a Real-World Glass Cutting Problem -- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic -- Improving Vehicle Routing Using a Customer Waiting Time Colony -- New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms -- Improving Edge Recombination through Alternate Inheritance and Greedy Manner -- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm -- On Search Space Symmetry in Partitioning Problems.
Record Nr. UNISA-996465531803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : Powerful Tools for Optimization / / by Christian Blum, Günther R. Raidl
Hybrid Metaheuristics [[electronic resource] ] : Powerful Tools for Optimization / / by Christian Blum, Günther R. Raidl
Autore Blum Christian
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XVI, 157 p. 20 illus., 9 illus. in color.)
Disciplina 005.1
Collana Artificial Intelligence: Foundations, Theory, and Algorithms
Soggetto topico Artificial intelligence
Computers
Computational intelligence
Operations research
Decision making
Mathematical optimization
Artificial Intelligence
Theory of Computation
Computational Intelligence
Operations Research/Decision Theory
Optimization
ISBN 3-319-30883-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Incomplete Solution Representations and Decoders -- Hybridization Based on Problem Instance Reduction -- Hybridization Based on Large Neighborhood Search -- Making Use of a Parallel, Non-independent, Construction of Solutions Within Metaheuristics -- Hybridization Based on Complete Solution Archives -- Further Hybrids and Conclusions. .
Record Nr. UNINA-9910254993203321
Blum Christian  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui