04326nam a22005415i 4500 978-3-540-78604-7 DE-He213 20210625014247.0 cr nn 008mamaa 100301s2008 gw | s |||| 0|eng d 9783540786047 978-3-540-78604-7 10.1007/978-3-540-78604-7 doi QA75.5-76.95 UY bicssc COM037000 bisacsh UY thema 004.0151 23 Evolutionary Computation in Combinatorial Optimization [electronic resource] : 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, Proceedings / edited by Jano van Hemert, Carlos Cotta. 1st ed. 2008. Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008. XII, 292 p. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Theoretical Computer Science and General Issues ; 4972 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. Computers. Algorithms. Numerical analysis. Computer science—Mathematics. Computation by Abstract Devices. https://scigraph.springernature.com/ontologies/product-market-codes/I16013 Algorithm Analysis and Problem Complexity. https://scigraph.springernature.com/ontologies/product-market-codes/I16021 Numeric Computing. https://scigraph.springernature.com/ontologies/product-market-codes/I1701X Discrete Mathematics in Computer Science. https://scigraph.springernature.com/ontologies/product-market-codes/I17028 van Hemert, Jano. editor. edt http://id.loc.gov/vocabulary/relators/edt Cotta, Carlos. editor. edt http://id.loc.gov/vocabulary/relators/edt SpringerLink (Online service) Springer Nature eBook Printed edition: 9783540849339 Printed edition: 9783540786030 Theoretical Computer Science and General Issues ; 4972 https://doi.org/10.1007/978-3-540-78604-7 ZDB-2-SCS ZDB-2-SXCS ZDB-2-LNC Computer Science (SpringerNature-11645) Computer Science (R0) (SpringerNature-43710)