LEADER 04279nam  22007815  450 
001 9910484172003321
005 20251226203706.0
010   $a3-540-75514-4
024 7 $a10.1007/978-3-540-75514-2
035   $a(CKB)1000000000490657
035   $a(SSID)ssj0000318172
035   $a(PQKBManifestationID)11212525
035   $a(PQKBTitleCode)TC0000318172
035   $a(PQKBWorkID)10307458
035   $a(PQKB)10446461
035   $a(DE-He213)978-3-540-75514-2
035   $a(MiAaPQ)EBC3068180
035   $a(PPN)123165539
035   $a(MiAaPQ)EBC336852
035   $a(BIP)32374933
035   $a(BIP)17712301
035   $a(EXLCZ)991000000000490657
100   $a20100301d2007      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aHybrid Metaheuristics $e4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings /$fedited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (X, 201 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4771
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-540-75513-6 
320   $aIncludes bibliographical references and index.
327   $aEvolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems.
330   $aThis book constitutes the refereed proceedings of the 4th International Workshop on Hybrid Metaheuristics, HM 2007, held in Dortmund, Germany. The 14 revised full papers discuss specific aspects of hybridization of metaheuristics, hybrid metaheuristics design, development and testing. With increasing attention to methodological aspects, from both the empirical and theoretical sides, the papers show a representative sample of research in the field of hybrid metaheuristics.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4771
606   $aArtificial intelligence
606   $aAlgorithms
606   $aComputer science
606   $aNumerical analysis
606   $aPattern recognition systems
606   $aArtificial Intelligence
606   $aAlgorithms
606   $aTheory of Computation
606   $aNumerical Analysis
606   $aAutomated Pattern Recognition
615  0$aArtificial intelligence.
615  0$aAlgorithms.
615  0$aComputer science.
615  0$aNumerical analysis.
615  0$aPattern recognition systems.
615 14$aArtificial Intelligence.
615 24$aAlgorithms.
615 24$aTheory of Computation.
615 24$aNumerical Analysis.
615 24$aAutomated Pattern Recognition.
676   $a006.3
701   $aBartz-Beielstein$b Thomas$01337543
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484172003321
996   $aHybrid metaheuristics$94187861
997   $aUNINA