LEADER 04478nam  22008295  450 
001 9910483064503321
005 20251226202714.0
010   $a3-540-88439-4
024 7 $a10.1007/978-3-540-88439-2
035   $a(CKB)1000000000490656
035   $a(SSID)ssj0000318174
035   $a(PQKBManifestationID)11212526
035   $a(PQKBTitleCode)TC0000318174
035   $a(PQKBWorkID)10308797
035   $a(PQKB)10279124
035   $a(DE-He213)978-3-540-88439-2
035   $a(MiAaPQ)EBC3063646
035   $a(MiAaPQ)EBC6426758
035   $a(PPN)130185728
035   $a(EXLCZ)991000000000490656
100   $a20100301d2008      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aHybrid Metaheuristics $e5th International Workshop, HM 2008, Malaga, Spain, October 8-9, 2008. Proceedings /$fedited by Christian Blum, Carlos Cotta, Antonio José Fernández Leiva, José E. Gallardo Ruiz, Andrea Roli, Michael Sampels
205   $a1st ed. 2008.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008.
215   $a1 online resource (X, 203 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5296
300   $aIncludes index.
311 08$a3-540-88438-6 
320   $aIncludes bibliographical references and index.
327   $aAn Evolutionary ILS-Perturbation Technique -- A Cultural Algorithm for POMDPs from Stochastic Inventory Control -- A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems -- A Memetic Algorithm with Population Management (MA/PM) for the Periodic Location-Routing Problem -- Memetic Algorithm for Intense Local Search Methods Using Local Search Chains -- Incremental Particle Swarm-Guided Local Search for Continuous Optimization -- Optimised Search Heuristic Combining Valid Inequalities and Tabu Search -- Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem -- On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem -- Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems -- Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem -- Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks -- Combining Forces to Reconstruct Strip Shredded Text Documents -- A Memetic Algorithm for the Tool Switching Problem.
330   $aThis book constitutes the refereed proceedings of the 5th International Workshop on Hybrid Metaheuristics, HM 2008, held in Malaga, Spain, in October 2008. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers discuss specific aspects of combinations of metaheuristics and other solving techniques for tackling particular relevant constrained optimization problems, such as fiber optic networks, time tabling and freight train scheduling problems.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5296
606   $aData mining
606   $aComputer programming
606   $aComputer science
606   $aAlgorithms
606   $aInformation storage and retrieval systems
606   $aComputer science$xMathematics
606   $aMathematical statistics
606   $aData Mining and Knowledge Discovery
606   $aProgramming Techniques
606   $aTheory of Computation
606   $aAlgorithms
606   $aInformation Storage and Retrieval
606   $aProbability and Statistics in Computer Science
615  0$aData mining.
615  0$aComputer programming.
615  0$aComputer science.
615  0$aAlgorithms.
615  0$aInformation storage and retrieval systems.
615  0$aComputer science$xMathematics.
615  0$aMathematical statistics.
615 14$aData Mining and Knowledge Discovery.
615 24$aProgramming Techniques.
615 24$aTheory of Computation.
615 24$aAlgorithms.
615 24$aInformation Storage and Retrieval.
615 24$aProbability and Statistics in Computer Science.
676   $a006.3
702   $aBlum$b C$g(Christian),
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910483064503321
996   $aHybrid Metaheuristics$9772372
997   $aUNINA