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.
Ant Colony Optimization and Swarm Intelligence [[electronic resource] ] : 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5-8, 2004, Proceeding / / edited by Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, Thomas Stützle
| Ant Colony Optimization and Swarm Intelligence [[electronic resource] ] : 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5-8, 2004, Proceeding / / edited by Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, Thomas Stützle |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 438 p.) |
| Disciplina | 519.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science Algorithms Computers Numerical analysis Computer science—Mathematics Optimization Computer Science, general Algorithm Analysis and Problem Complexity Computation by Abstract Devices Numeric Computing Discrete Mathematics in Computer Science |
| ISBN | 3-540-28646-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Comparison Between ACO Algorithms for the Set Covering Problem -- A Comparison Between ACO Algorithms for the Set Covering Problem -- A VLSI Multiplication-and-Add Scheme Based on Swarm Intelligence Approaches -- ACO for Continuous and Mixed-Variable Optimization -- An Ant Approach to Membership Overlay Design -- An Ant Colony Optimisation Algorithm for the Set Packing Problem -- An Empirical Analysis of Multiple Objective Ant Colony Optimization Algorithms for the Bi-criteria TSP -- An External Memory Implementation in Ant Colony Optimization -- BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior -- Competition Controlled Pheromone Update for Ant Colony Optimization -- Cooperative Transport of Objects of Different Shapes and Sizes -- Deception in Ant Colony Optimization -- Evolution of Direct Communication for a Swarm-bot Performing Hole Avoidance -- Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities -- Improvements on Ant Routing for Sensor Networks -- Integrating ACO and Constraint Propagation -- Logistic Constraints on 3D Termite Construction -- Modeling Ant Behavior Under a Variable Environment -- Multi-type Ant Colony: The Edge Disjoint Paths Problem -- On the Design of ACO for the Biobjective Quadratic Assignment Problem -- Reasons of ACO’s Success in TSP -- S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty -- Time-Scattered Heuristic for the Hardware Implementation of Population-Based ACO -- Short Papers -- Ad Hoc Networking with Swarm Intelligence -- An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks -- An Experimental Analysis of Loop-Free Algorithms for Scale-Free Networks -- An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem -- An Extension of Ant Colony System to Continuous Optimization Problems -- Ant Algorithms for Urban Waste Collection Routing -- Ants Can Play Music -- Backtracking Ant System for the Traveling Salesman Problem -- Colored Ants for Distributed Simulations -- Dynamic Routing in Mobile Wireless Networks Using ABC-AdHoc -- Fuzzy Ant Based Clustering -- How to Use Ants for Hierarchical Clustering -- Inversing Mechanical Parameters of Concrete Gravity Dams Using Ant Colony Optimization -- Large Pheromones: A Case Study with Multi-agent Physical A* -- Near Parameter Free Ant Colony Optimisation -- Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem -- Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation -- Task Oriented Functional Self-organization of Mobile Agents Team: Memory Optimization Based on Correlation Feature -- Towards a Real Micro Robotic Swarm -- Posters -- A Hybrid Ant Colony System Approach for the Capacitated Vehicle Routing Problem -- A Swarm-Based Approach for Selection of Signal Plans in Urban Scenarios -- Ant Colony Behaviour as Routing Mechanism to Provide Quality of Service -- Applying Ant Colony Optimization to the Capacitated Arc Routing Problem -- Dynamic Optimization Through Continuous Interacting Ant Colony -- Dynamic Routing in Traffic Networks Using AntNet -- First Competitive Ant Colony Scheme for the CARP -- Hypothesis Corroboration in Semantic Spaces with Swarming Agents -- Mesh-Partitioning with the Multiple Ant-Colony Algorithm. |
| Record Nr. | UNINA-9910144165903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Ant Colony Optimization and Swarm Intelligence [[electronic resource] ] : 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5-8, 2004, Proceeding / / edited by Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, Thomas Stützle
| Ant Colony Optimization and Swarm Intelligence [[electronic resource] ] : 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5-8, 2004, Proceeding / / edited by Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, Thomas Stützle |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 438 p.) |
| Disciplina | 519.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science Algorithms Computers Numerical analysis Computer science—Mathematics Optimization Computer Science, general Algorithm Analysis and Problem Complexity Computation by Abstract Devices Numeric Computing Discrete Mathematics in Computer Science |
| ISBN | 3-540-28646-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Comparison Between ACO Algorithms for the Set Covering Problem -- A Comparison Between ACO Algorithms for the Set Covering Problem -- A VLSI Multiplication-and-Add Scheme Based on Swarm Intelligence Approaches -- ACO for Continuous and Mixed-Variable Optimization -- An Ant Approach to Membership Overlay Design -- An Ant Colony Optimisation Algorithm for the Set Packing Problem -- An Empirical Analysis of Multiple Objective Ant Colony Optimization Algorithms for the Bi-criteria TSP -- An External Memory Implementation in Ant Colony Optimization -- BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior -- Competition Controlled Pheromone Update for Ant Colony Optimization -- Cooperative Transport of Objects of Different Shapes and Sizes -- Deception in Ant Colony Optimization -- Evolution of Direct Communication for a Swarm-bot Performing Hole Avoidance -- Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities -- Improvements on Ant Routing for Sensor Networks -- Integrating ACO and Constraint Propagation -- Logistic Constraints on 3D Termite Construction -- Modeling Ant Behavior Under a Variable Environment -- Multi-type Ant Colony: The Edge Disjoint Paths Problem -- On the Design of ACO for the Biobjective Quadratic Assignment Problem -- Reasons of ACO’s Success in TSP -- S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty -- Time-Scattered Heuristic for the Hardware Implementation of Population-Based ACO -- Short Papers -- Ad Hoc Networking with Swarm Intelligence -- An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks -- An Experimental Analysis of Loop-Free Algorithms for Scale-Free Networks -- An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem -- An Extension of Ant Colony System to Continuous Optimization Problems -- Ant Algorithms for Urban Waste Collection Routing -- Ants Can Play Music -- Backtracking Ant System for the Traveling Salesman Problem -- Colored Ants for Distributed Simulations -- Dynamic Routing in Mobile Wireless Networks Using ABC-AdHoc -- Fuzzy Ant Based Clustering -- How to Use Ants for Hierarchical Clustering -- Inversing Mechanical Parameters of Concrete Gravity Dams Using Ant Colony Optimization -- Large Pheromones: A Case Study with Multi-agent Physical A* -- Near Parameter Free Ant Colony Optimisation -- Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem -- Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation -- Task Oriented Functional Self-organization of Mobile Agents Team: Memory Optimization Based on Correlation Feature -- Towards a Real Micro Robotic Swarm -- Posters -- A Hybrid Ant Colony System Approach for the Capacitated Vehicle Routing Problem -- A Swarm-Based Approach for Selection of Signal Plans in Urban Scenarios -- Ant Colony Behaviour as Routing Mechanism to Provide Quality of Service -- Applying Ant Colony Optimization to the Capacitated Arc Routing Problem -- Dynamic Optimization Through Continuous Interacting Ant Colony -- Dynamic Routing in Traffic Networks Using AntNet -- First Competitive Ant Colony Scheme for the CARP -- Hypothesis Corroboration in Semantic Spaces with Swarming Agents -- Mesh-Partitioning with the Multiple Ant-Colony Algorithm. |
| Record Nr. | UNISA-996465421703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers / / edited by Christian Blum, Gabriela Ochoa
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers / / edited by Christian Blum, Gabriela Ochoa |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 241 p. 62 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer science Numerical Analysis Discrete Mathematics in Computer Science Theory of Computation |
| ISBN | 3-662-44320-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Table of Contents -- A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem -- 1 Introduction -- 1.1 Notation -- 1.2 Problem Definition -- 1.3 Related Work -- 1.4 Organization of the Paper -- 2 A Linear Integer Programming Model -- 3 The Proposed Approach -- 3.1 Preliminaries -- 3.2 Algorithmic Framework -- 3.3 The ACO Phase -- 4 Experimental Evaluation -- 4.1 Problem Instances -- 4.2 Results -- 5 Conclusions and Future Work -- References -- A Parametric Framework for Cooperative Parallel Local Search -- 1 Introduction -- 2 Local Search and Parallelism -- 3 Cooperative Search Framework -- 3.1 Framework Design -- 3.2 Ensuring Diversification -- 3.3 Ensuring Intensification -- 4 An X10 Implementation -- 5 Results and Analysis -- 6 Conclusion and Further Work -- References -- A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube -- 1 Introduction -- 2 Algorithm Descriptions -- 2.1 Genetic Algorithms -- 2.2 Simulated Annealing -- 2.3 Iterated Local Search -- 3 Mutations -- 4 Evaluation Functions -- 5 Experiments -- 5.1 Effect of Algorithm Parameters -- 5.2 Effect of the Mutations -- 5.3 Effect of the Evaluation Function -- 5.4 Scalability of the Algorithms -- 6 HighScores -- 7 Conclusion -- References -- An Analysis of Parameters of irace -- 1 Introduction -- 2 The irace Procedure -- 3 Experimental Setup -- 3.1 Configuration Scenarios -- 3.2 Training Set Analysis -- 3.3 Experimental Setup -- 4 Experiments -- 5 Final Remarks and Future Work -- References -- An Improved Multi-objective Algorithm for the Urban Transit Routing Problem -- 1 Introduction -- 2 Problem Description -- 3 Methodology -- 3.1 NSGAII -- 3.2 Heuristic Construction -- 3.3 Genetic Operators -- 4 Results -- 5 Conclusion -- References.
An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments -- 1 Introduction -- 2 Problem Description -- 3 Iterated Greedy Heuristic for the LSSPFS -- 3.1 Solution Representation -- 3.2 Construction of an Initial Solution -- 3.3 Destruction and Construction Procedures -- 3.4 Local Search -- 3.5 Lot-sizing Improvement -- 4 Computational Experiments -- 4.1 Calibration of the IG Heuristic -- 4.2 Results and Comparisons -- 4.3 Analysis of the Computational Times -- 5 Conclusion -- References -- Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 4 Modeling the Dynamic Scenario -- 4.1 Segments and Events -- 4.2 Expected Number of Bikes at Stations -- 4.3 Classification of Stations -- 4.4 Restrictions on Loading Instructions -- 5 Greedy Construction Heuristic -- 6 Metaheuristic Approaches -- 7 Computational Results -- 8 Conclusions and Future Work -- References -- Cooperative Selection: Improving Tournament Selection via Altruism -- 1 Introduction -- 2 Cooperative Selection -- 2.1 Scheme Description -- 2.2 Properties and Tuning of Parameters -- 3 Validating Cooperative Selection in a Noisy Real Problem -- 3.1 Estimated Secondary Structure Similarity (ESSS) -- 3.2 Experimental Setup -- 3.3 Analysis of Results -- 4 Conclusions and Future Works -- References -- Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem -- 1 Introduction -- 2 Background -- 2.1 Problem Definition -- 2.2 MAENS -- 2.3 Approximation Algorithms -- 3 A Distance Measure for the CARP -- 3.1 Measuring the Average Diversity of the Population -- 3.2 A Revised Distance Measure Based on Neighbour Tasks -- 3.3 Diversity-Driven Stochastic Ranking -- 4 Operator Selection -- 4.1 Crossover Operators. 4.2 Adaptive Operator Selection -- 5 Experimental Studies -- 6 Conclusions -- References -- Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance -- 1 Introduction -- 2 Related Works -- 3 Storm Drains Maintenance Problem -- 4 Adaptive Planning Heuristic (APH) -- 4.1 Routing Stage -- 4.2 Adaptive Planning Stage -- 5 Computational Results -- 6 Conclusion -- References -- Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem -- 1 Introduction -- 2 Background on Landscape Theory -- 3 Hamiltonian Path Optimization Problem -- 4 Landscape for Reversals -- 4.1 Component Model -- 4.2 Proof of Elementariness -- 5 Landscape Structure for Swaps -- 5.1 Previous Results for QAP -- 5.2 Elementary Landscape Decomposition of the HPO -- 6 Conclusions and Future Work -- References -- Gaussian Based Particle Swarm Optimisation and Statistical Clustering for Feature Selection -- 1 Introduction -- 1.1 Goals -- 2 Background -- 2.1 Particle Swarm Optimisation (PSO) -- 2.2 Related Work on Feature Selection -- 3 The Proposed Approach -- 3.1 Determine the Number of Features Selected -- 3.2 How to Select Features -- 4 Experimental Design -- 5 Results and Discussions -- 5.1 Results of GPSO -- 5.2 Comparisons on Computational Time -- 5.3 Further Comparisons with Traditional Methods -- 6 Conclusions and Future Work -- References -- Global Optimization of Multimodal Deceptive Functions -- 1 Introduction -- 2 Preliminaries -- 2.1 Simulated Annealing -- 2.2 Graph Clustering Based Model Building -- 3 Extended Simulated Annealing -- 4 Experiments -- 5 Results -- 5.1 Performance of the Classical Simulated Annealing -- 5.2 Performance of the Extended Simulated Annealing -- 6 Conclusions -- References -- Learning Inherent Networks from Stochastic Search Methods -- 1 Introduction -- 2 Methods. 2.1 Studied Problem and Search Heuristic -- 2.2 Monitoring the Search Dynamics -- 2.3 The Nodes -- 2.4 The Edges -- 3 Experiments -- 4 Results -- 4.1 Comparative and Convergence Analysis of the Inherent Networks -- 4.2 Structure of the Inherent Networks -- 5 Conclusions -- References -- Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 3.1 Time Window Model -- 3.2 Objective -- 4 Solution Methods -- 4.1 Local Search Operators -- 4.2 Metaheuristics -- 5 Computational Experiments -- 5.1 Generating Orders -- 5.2 Speed and Travel Parameters -- 5.3 Aims -- 5.4 Findings -- 6 Conclusions and Future Work -- References -- Modeling an Artificial Bee Colony with Inspector for Clustering Tasks -- 1 Introduction -- 2 The Clustering Problem -- 3 Artificial Bee Colony -- 4 Inspector Bee in the Colony -- 5 Algorithm Structure and Fitness Function -- 6 Experimental Results -- 6.1 Convergence Analysis -- 7 Conclusions and Future Work -- References -- Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach -- 1 Introduction -- 2 Related Literature -- 3 The Proposed Algorithm -- 3.1 General Structure of the Algorithm -- 3.2 Initialization -- 3.3 Genetic Algorithm -- 3.4 Variable Neighborhood Descent -- 4 Computational Experiments -- 4.1 Benchmark Instances -- 4.2 Results -- 5 Conclusion -- References -- Phase Transition and Landscape Properties of the Number Partitioning Problem -- 1 Introduction -- 2 Number Partitioning Problem -- 2.1 Problem Definition -- 2.2 Phase Transition in NPP -- 3 Landscape of NPP -- 3.1 Definitions and Experimental Setup -- 3.2 Experimental Results -- 4 Conclusions -- References -- The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms -- 1 Introduction -- 2 The Proposed Algorithms. 2.1 Solution Representation and Pheromone Model -- 2.2 ACO: A Pure MMAS Approach -- 2.3 HyACO: A Hybrid ACO Variant -- 3 Experimental Evaluation -- 4 Conclucions and Future Work -- References -- The Influence of Correlated Objectives on Different Types of P-ACO Algorithms -- 1 Introduction -- 2 MOPs with Correlated Objectives -- 3 Ranking Methods for MOPs and P-ACO -- 4 Results -- 4.1 Expected Correlation -- 4.2 Experimental Results -- 5 Conclusion -- References -- Author Index. |
| Record Nr. | UNISA-996202528403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers / / edited by Christian Blum, Gabriela Ochoa
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers / / edited by Christian Blum, Gabriela Ochoa |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 241 p. 62 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer science Numerical Analysis Discrete Mathematics in Computer Science Theory of Computation |
| ISBN | 3-662-44320-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Table of Contents -- A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem -- 1 Introduction -- 1.1 Notation -- 1.2 Problem Definition -- 1.3 Related Work -- 1.4 Organization of the Paper -- 2 A Linear Integer Programming Model -- 3 The Proposed Approach -- 3.1 Preliminaries -- 3.2 Algorithmic Framework -- 3.3 The ACO Phase -- 4 Experimental Evaluation -- 4.1 Problem Instances -- 4.2 Results -- 5 Conclusions and Future Work -- References -- A Parametric Framework for Cooperative Parallel Local Search -- 1 Introduction -- 2 Local Search and Parallelism -- 3 Cooperative Search Framework -- 3.1 Framework Design -- 3.2 Ensuring Diversification -- 3.3 Ensuring Intensification -- 4 An X10 Implementation -- 5 Results and Analysis -- 6 Conclusion and Further Work -- References -- A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube -- 1 Introduction -- 2 Algorithm Descriptions -- 2.1 Genetic Algorithms -- 2.2 Simulated Annealing -- 2.3 Iterated Local Search -- 3 Mutations -- 4 Evaluation Functions -- 5 Experiments -- 5.1 Effect of Algorithm Parameters -- 5.2 Effect of the Mutations -- 5.3 Effect of the Evaluation Function -- 5.4 Scalability of the Algorithms -- 6 HighScores -- 7 Conclusion -- References -- An Analysis of Parameters of irace -- 1 Introduction -- 2 The irace Procedure -- 3 Experimental Setup -- 3.1 Configuration Scenarios -- 3.2 Training Set Analysis -- 3.3 Experimental Setup -- 4 Experiments -- 5 Final Remarks and Future Work -- References -- An Improved Multi-objective Algorithm for the Urban Transit Routing Problem -- 1 Introduction -- 2 Problem Description -- 3 Methodology -- 3.1 NSGAII -- 3.2 Heuristic Construction -- 3.3 Genetic Operators -- 4 Results -- 5 Conclusion -- References.
An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments -- 1 Introduction -- 2 Problem Description -- 3 Iterated Greedy Heuristic for the LSSPFS -- 3.1 Solution Representation -- 3.2 Construction of an Initial Solution -- 3.3 Destruction and Construction Procedures -- 3.4 Local Search -- 3.5 Lot-sizing Improvement -- 4 Computational Experiments -- 4.1 Calibration of the IG Heuristic -- 4.2 Results and Comparisons -- 4.3 Analysis of the Computational Times -- 5 Conclusion -- References -- Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 4 Modeling the Dynamic Scenario -- 4.1 Segments and Events -- 4.2 Expected Number of Bikes at Stations -- 4.3 Classification of Stations -- 4.4 Restrictions on Loading Instructions -- 5 Greedy Construction Heuristic -- 6 Metaheuristic Approaches -- 7 Computational Results -- 8 Conclusions and Future Work -- References -- Cooperative Selection: Improving Tournament Selection via Altruism -- 1 Introduction -- 2 Cooperative Selection -- 2.1 Scheme Description -- 2.2 Properties and Tuning of Parameters -- 3 Validating Cooperative Selection in a Noisy Real Problem -- 3.1 Estimated Secondary Structure Similarity (ESSS) -- 3.2 Experimental Setup -- 3.3 Analysis of Results -- 4 Conclusions and Future Works -- References -- Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem -- 1 Introduction -- 2 Background -- 2.1 Problem Definition -- 2.2 MAENS -- 2.3 Approximation Algorithms -- 3 A Distance Measure for the CARP -- 3.1 Measuring the Average Diversity of the Population -- 3.2 A Revised Distance Measure Based on Neighbour Tasks -- 3.3 Diversity-Driven Stochastic Ranking -- 4 Operator Selection -- 4.1 Crossover Operators. 4.2 Adaptive Operator Selection -- 5 Experimental Studies -- 6 Conclusions -- References -- Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance -- 1 Introduction -- 2 Related Works -- 3 Storm Drains Maintenance Problem -- 4 Adaptive Planning Heuristic (APH) -- 4.1 Routing Stage -- 4.2 Adaptive Planning Stage -- 5 Computational Results -- 6 Conclusion -- References -- Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem -- 1 Introduction -- 2 Background on Landscape Theory -- 3 Hamiltonian Path Optimization Problem -- 4 Landscape for Reversals -- 4.1 Component Model -- 4.2 Proof of Elementariness -- 5 Landscape Structure for Swaps -- 5.1 Previous Results for QAP -- 5.2 Elementary Landscape Decomposition of the HPO -- 6 Conclusions and Future Work -- References -- Gaussian Based Particle Swarm Optimisation and Statistical Clustering for Feature Selection -- 1 Introduction -- 1.1 Goals -- 2 Background -- 2.1 Particle Swarm Optimisation (PSO) -- 2.2 Related Work on Feature Selection -- 3 The Proposed Approach -- 3.1 Determine the Number of Features Selected -- 3.2 How to Select Features -- 4 Experimental Design -- 5 Results and Discussions -- 5.1 Results of GPSO -- 5.2 Comparisons on Computational Time -- 5.3 Further Comparisons with Traditional Methods -- 6 Conclusions and Future Work -- References -- Global Optimization of Multimodal Deceptive Functions -- 1 Introduction -- 2 Preliminaries -- 2.1 Simulated Annealing -- 2.2 Graph Clustering Based Model Building -- 3 Extended Simulated Annealing -- 4 Experiments -- 5 Results -- 5.1 Performance of the Classical Simulated Annealing -- 5.2 Performance of the Extended Simulated Annealing -- 6 Conclusions -- References -- Learning Inherent Networks from Stochastic Search Methods -- 1 Introduction -- 2 Methods. 2.1 Studied Problem and Search Heuristic -- 2.2 Monitoring the Search Dynamics -- 2.3 The Nodes -- 2.4 The Edges -- 3 Experiments -- 4 Results -- 4.1 Comparative and Convergence Analysis of the Inherent Networks -- 4.2 Structure of the Inherent Networks -- 5 Conclusions -- References -- Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 3.1 Time Window Model -- 3.2 Objective -- 4 Solution Methods -- 4.1 Local Search Operators -- 4.2 Metaheuristics -- 5 Computational Experiments -- 5.1 Generating Orders -- 5.2 Speed and Travel Parameters -- 5.3 Aims -- 5.4 Findings -- 6 Conclusions and Future Work -- References -- Modeling an Artificial Bee Colony with Inspector for Clustering Tasks -- 1 Introduction -- 2 The Clustering Problem -- 3 Artificial Bee Colony -- 4 Inspector Bee in the Colony -- 5 Algorithm Structure and Fitness Function -- 6 Experimental Results -- 6.1 Convergence Analysis -- 7 Conclusions and Future Work -- References -- Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach -- 1 Introduction -- 2 Related Literature -- 3 The Proposed Algorithm -- 3.1 General Structure of the Algorithm -- 3.2 Initialization -- 3.3 Genetic Algorithm -- 3.4 Variable Neighborhood Descent -- 4 Computational Experiments -- 4.1 Benchmark Instances -- 4.2 Results -- 5 Conclusion -- References -- Phase Transition and Landscape Properties of the Number Partitioning Problem -- 1 Introduction -- 2 Number Partitioning Problem -- 2.1 Problem Definition -- 2.2 Phase Transition in NPP -- 3 Landscape of NPP -- 3.1 Definitions and Experimental Setup -- 3.2 Experimental Results -- 4 Conclusions -- References -- The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms -- 1 Introduction -- 2 The Proposed Algorithms. 2.1 Solution Representation and Pheromone Model -- 2.2 ACO: A Pure MMAS Approach -- 2.3 HyACO: A Hybrid ACO Variant -- 3 Experimental Evaluation -- 4 Conclucions and Future Work -- References -- The Influence of Correlated Objectives on Different Types of P-ACO Algorithms -- 1 Introduction -- 2 MOPs with Correlated Objectives -- 3 Ranking Methods for MOPs and P-ACO -- 4 Results -- 4.1 Expected Correlation -- 4.2 Experimental Results -- 5 Conclusion -- References -- Author Index. |
| Record Nr. | UNINA-9910484703403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings / / edited by Martin Middendorf, Christian Blum
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings / / edited by Martin Middendorf, Christian Blum |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 275 p. 57 illus.) |
| Disciplina | 006.3823 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer science Numerical Analysis Discrete Mathematics in Computer Science Theory of Computation |
| ISBN | 3-642-37198-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Hyper-heuristic with a Round Robin Neighbourhood -- A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks -- A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory -- A New Crossover for Solving Constraint Satisfaction Problems -- A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs -- A Study of Adaptive Perturbation Strategy for Iterated Local Search -- Adaptive MOEA/D for QoS-Based Web Service Composition -- An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem -- An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem -- Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis -- Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach -- Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem -- Dynamic Evolutionary Membrane Algorithm in Dynamic Environments -- From Sequential to Parallel Local Search for SAT -- Generalizing Hyper-heuristics via Apprenticeship Learning -- High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem -- Investigating Monte-Carlo Methods on the Weak Schur Problem -- Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches -- Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape -- Single Line Train Scheduling with ACO -- Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search -- Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent -- The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. |
| Record Nr. | UNISA-996465611303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings / / edited by Martin Middendorf, Christian Blum
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings / / edited by Martin Middendorf, Christian Blum |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 275 p. 57 illus.) |
| Disciplina | 006.3823 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer science Numerical Analysis Discrete Mathematics in Computer Science Theory of Computation |
| ISBN | 3-642-37198-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Hyper-heuristic with a Round Robin Neighbourhood -- A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks -- A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory -- A New Crossover for Solving Constraint Satisfaction Problems -- A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs -- A Study of Adaptive Perturbation Strategy for Iterated Local Search -- Adaptive MOEA/D for QoS-Based Web Service Composition -- An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem -- An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem -- Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis -- Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach -- Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem -- Dynamic Evolutionary Membrane Algorithm in Dynamic Environments -- From Sequential to Parallel Local Search for SAT -- Generalizing Hyper-heuristics via Apprenticeship Learning -- High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem -- Investigating Monte-Carlo Methods on the Weak Schur Problem -- Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches -- Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape -- Single Line Train Scheduling with ACO -- Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search -- Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent -- The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. |
| Record Nr. | UNINA-9910741162503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
GECCO'13 : proceedings of the 2013 Genetic and Evolutionary Computation Conference : July 6-10, 2013, Amsterdam, The Netherlands
| GECCO'13 : proceedings of the 2013 Genetic and Evolutionary Computation Conference : July 6-10, 2013, Amsterdam, The Netherlands |
| Autore | Alba Enrique |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2013 |
| Descrizione fisica | 1 online resource (1640 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| ISBN | 1-4503-1963-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Genetic and Evolutionary Computation Conference Companion'13 : proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion : July 6-10, 2013, Amsterdam, The Netherlands
Proceeding of the fifteenth annual Conference on Genetic and Evolutionary Computation Conference GECCO '13 Genetic and Evolutionary Computation Conference, Amsterdam, Netherlands - July 06 - 10, 2013 |
| Record Nr. | UNINA-9910375879503321 |
Alba Enrique
|
||
| [Place of publication not identified], : ACM, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
GECCO'13 : proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion : July 6-10, 2013, Amsterdam, The Netherlands
| GECCO'13 : proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion : July 6-10, 2013, Amsterdam, The Netherlands |
| Autore | Alba Enrique |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2013 |
| Descrizione fisica | 1 online resource (1766 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| ISBN | 1-4503-1964-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Genetic and Evolutionary Computation Conference Companion'13 : proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion : July 6-10, 2013, Amsterdam, The Netherlands
Proceeding of the fifteenth annual Conference Companion on Genetic and Evolutionary Computation Conference Companion GECCO '13 Genetic and Evolutionary Computation Conference, Amsterdam, Netherlands - July 06 - 10, 2013 |
| Record Nr. | UNINA-9910375887803321 |
|
Alba Enrique
|
||
| [Place of publication not identified], : ACM, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hybrid Metaheuristics [[electronic resource] ] : 11th International Workshop, HM 2019, Concepción, Chile, January 16–18, 2019, Proceedings / / edited by Maria J. Blesa Aguilera, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, Julio Godoy del Campo
| Hybrid Metaheuristics [[electronic resource] ] : 11th International Workshop, HM 2019, Concepción, Chile, January 16–18, 2019, Proceedings / / edited by Maria J. Blesa Aguilera, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, Julio Godoy del Campo |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 209 p. 46 illus., 18 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Artificial Intelligence Numerical Analysis Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-030-05983-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466457003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Hybrid Metaheuristics [[electronic resource] ] : 11th International Workshop, HM 2019, Concepción, Chile, January 16–18, 2019, Proceedings / / edited by Maria J. Blesa Aguilera, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, Julio Godoy del Campo
| Hybrid Metaheuristics [[electronic resource] ] : 11th International Workshop, HM 2019, Concepción, Chile, January 16–18, 2019, Proceedings / / edited by Maria J. Blesa Aguilera, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, Julio Godoy del Campo |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 209 p. 46 illus., 18 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Artificial Intelligence Numerical Analysis Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-030-05983-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910337569103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
