04697nam 2200769 a 450 991048399110332120200520144314.01-280-38599-597866135639103-642-12139-X10.1007/978-3-642-12139-5(CKB)2560000000009125(SSID)ssj0000399478(PQKBManifestationID)11297910(PQKBTitleCode)TC0000399478(PQKBWorkID)10384364(PQKB)10730402(DE-He213)978-3-642-12139-5(MiAaPQ)EBC3065193(PPN)14907350X(EXLCZ)99256000000000912520100209d2010 uy 0engurnn#008mamaatxtccrEvolutionary computation in combinatorial optimization 10th European conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010 : proceedings /Peter Cowling, Peter Merz (eds.)1st ed. 2010.New York Springer20101 online resource (XII, 290 p. 67 illus.)Lecture notes in computer science,0302-9743 ;6022LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-642-12138-1 Includes bibliographical references and index.Dual 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.Lecture notes in computer science ;6022.LNCS sublibrary.SL 1,Theoretical computer science and general issues.EvoCOP 2010Evolutionary programming (Computer science)CongressesEvolutionary computationCongressesCombinatorial optimizationData processingCongressesGenetic algorithmsCongressesEvolutionary programming (Computer science)Evolutionary computationCombinatorial optimizationData processingGenetic algorithms005.154.10bcl31.12bcl31.76bcl30.10bclDAT 718fstubMAT 913fstubMAT 919fstubSS 4800rvkCowling Peter I(Peter Ivan)1753896Merz PeterDr.-Ing.1753897EvoCOP (Conference)MiAaPQMiAaPQMiAaPQBOOK9910483991103321Evolutionary computation in combinatorial optimization4189960UNINA