000 | 04389nam a22003855i 4500 | ||
---|---|---|---|
001 | 294952 | ||
003 | MX-SnUAN | ||
005 | 20190906114047.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2005 gw | o |||| 0|eng d | ||
020 |
_a9783540319962 _99783540319962 |
||
024 | 7 |
_a10.1007/b107115 _2doi |
|
035 | _avtls000348107 | ||
039 | 9 |
_a201509031110 _bVLOAD _c201405070459 _dVLOAD _y201402071019 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQA75.5-76.95 | |
100 | 1 |
_9328996 _aRaidl, Günther R. _eeditor. |
|
245 | 1 | 0 |
_aEvolutionary Computation in Combinatorial Optimization : _b5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005. Proceedings / _cedited by Günther R. Raidl, Jens Gottlieb. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. |
|
300 |
_axI, 271 páginas Also available online. _brecurso en línea. |
||
336 |
_atexto _btxt _2rdacontent |
||
337 |
_acomputadora _bc _2rdamedia |
||
338 |
_arecurso en línea _bcr _2rdacarrier |
||
347 |
_aarchivo de texto _bPDF _2rda |
||
490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3448 |
|
500 | _aSpringer eBooks | ||
505 | 0 | _aAn External Partial Permutations Memory for Ant Colony Optimization -- A Novel Application of Evolutionary Computing in Process Systems Engineering -- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework -- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem -- EvoGeneS, a New Evolutionary Approach to Graph Generation -- On the Application of Evolutionary Algorithms to the Consensus Tree Problem -- Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem -- Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem -- Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm – MOMGA-IIa -- Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions -- Estimation of Distribution Algorithms with Mutation -- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution -- Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring -- Application of the Grouping Genetic Algorithm to University Course Timetabling -- Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems -- Population Training Heuristics -- Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem -- The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem -- Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator -- Ant Algorithm for the Graph Matching Problem -- An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem -- An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem -- A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem -- An Agent Model for Binary Constraint Satisfaction Problems. | |
520 | _aThis book constitutes the refereed proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2005, held in Lausanne, Switzerland in March/April 2005. The 24 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers cover evolutionary algorithms as well as related approaches like scatter search, simulated annealing, ant colony optimization, immune algorithms, variable neighborhood search, hyperheuristics, and estimation of distribution algorithms. The papers deal with representations, analysis of operators and fitness landscapes, and comparison algorithms. Among the combinatorial optimization problems studied are graph coloring, quadratic assignment, knapsack, graph matching, packing, scheduling, timetabling, lot-sizing, and the traveling salesman problem. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aGottlieb, Jens. _eeditor. _9328997 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783540253372 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b107115 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c294952 _d294952 |