LEADER 06439nam 22009255 450 001 9910483991103321 005 20251226202151.0 010 $a1-280-38599-5 010 $a9786613563910 010 $a3-642-12139-X 024 7 $a10.1007/978-3-642-12139-5 035 $a(CKB)2560000000009125 035 $a(SSID)ssj0000399478 035 $a(PQKBManifestationID)11297910 035 $a(PQKBTitleCode)TC0000399478 035 $a(PQKBWorkID)10384364 035 $a(PQKB)10730402 035 $a(DE-He213)978-3-642-12139-5 035 $a(MiAaPQ)EBC3065193 035 $a(PPN)14907350X 035 $a(BIP)29190079 035 $a(EXLCZ)992560000000009125 100 $a20100402d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aEvolutionary Computation in Combinatorial Optimization $e10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings /$fedited by Peter I. Cowling, Peter Merz 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 290 p. 67 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6022 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-12138-1 320 $aIncludes bibliographical references and index. 327 $aDual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling -- Heuristic and Exact Methods for the Discrete (r /p)-Centroid Problem -- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme -- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study -- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems -- A Genetic Algorithm to Minimize Chromatic Entropy -- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings -- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks -- Ant Colony Optimization for Tree Decompositions -- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times -- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures -- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems -- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations -- A Study of Memetic Search with Multi-parent Combination for UBQP -- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing -- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres -- Geometric Generalization of the Nelder-Mead Algorithm -- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows -- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles -- Multilevel Variable Neighborhood Search for Periodic Routing Problems -- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive -- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem -- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem -- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem. 330 $aMetaheuristicscontinuetodemonstratetheire'ectivenessforanever-broadening range of di'cult combinatorial optimization problems appearing in a wide - riety of industrial, economic, and scienti'c domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization and estimation of distribution algorithms. Problems solved successfully include scheduling,timetabling,networkdesign,transportationanddistribution,vehicle routing, the travelling salesman problem, packing and cutting, satis'ability and general mixed integer programming. EvoCOP began in 2001 and has been held annually since then. It is the ?rst event speci'cally dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems. Originally held as a workshop,EvoCOPbecameaconferencein2004.Theeventsgaveresearchersan excellent opportunity to present their latest research and to discuss current - velopments and applications. Following the general trend of hybrid metaheur- tics and diminishing boundaries between the di'erent classes of metaheuristics, EvoCOPhas broadenedits scope in recent years and invited submissions on any kind of metaheuristic for combinatorial optimization. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6022 606 $aAlgorithms 606 $aComputer science 606 $aPattern recognition systems 606 $aComputer vision 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aTheory of Computation 606 $aAutomated Pattern Recognition 606 $aComputer Vision 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aPattern recognition systems. 615 0$aComputer vision. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aTheory of Computation. 615 24$aAutomated Pattern Recognition. 615 24$aComputer Vision. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.1 686 $a54.10$2bcl 686 $a31.12$2bcl 686 $a31.76$2bcl 686 $a30.10$2bcl 686 $aDAT 718f$2stub 686 $aMAT 913f$2stub 686 $aMAT 919f$2stub 686 $aSS 4800$2rvk 701 $aCowling$b Peter I$g(Peter Ivan)$01753896 701 $aMerz$b Peter$cDr.-Ing.$01753897 712 12$aEvoCOP (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483991103321 996 $aEvolutionary computation in combinatorial optimization$94189960 997 $aUNINA