000 04109nam a22006255i 4500
001 978-3-540-24652-7
003 DE-He213
005 20240423130111.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540246527
_9978-3-540-24652-7
024 7 _a10.1007/b96499
_2doi
050 4 _aQA402.5-402.6
072 7 _aPBU
_2bicssc
072 7 _aMAT042000
_2bisacsh
072 7 _aPBU
_2thema
082 0 4 _a519.6
_223
245 1 0 _aEvolutionary Computation in Combinatorial Optimization
_h[electronic resource] :
_b4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings /
_cedited by Jens Gottlieb, Günther R. Raidl.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aX, 240 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3004
505 0 _aEvoCOP Contributions -- Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm -- Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms -- Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem -- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem -- AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem -- Scatter Search and Memetic Approaches to the Error Correcting Code Problem -- A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem -- Parallel Ant Systems for the Capacitated Vehicle Routing Problem -- A Hierarchical Social Metaheuristic for the Max-Cut Problem -- On the Structure of Sequential Search: Beyond “No Free Lunch” -- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support – A Case Study -- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems -- Binary Merge Model Representation of the Graph Colouring Problem -- Hardness Prediction for the University Course Timetabling Problem -- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem -- On the Use of Path Relinking for the ? – Hub Median Problem -- Solving a Real-World Glass Cutting Problem -- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic -- Improving Vehicle Routing Using a Customer Waiting Time Colony -- New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms -- Improving Edge Recombination through Alternate Inheritance and Greedy Manner -- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm -- On Search Space Symmetry inPartitioning Problems.
650 0 _aMathematical optimization.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aOptimization.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aNumerical Analysis.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aDiscrete Mathematics.
700 1 _aGottlieb, Jens.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRaidl, Günther R.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540213673
776 0 8 _iPrinted edition:
_z9783662172339
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3004
856 4 0 _uhttps://doi.org/10.1007/b96499
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c185043
_d185043