000 03871nam a22005775i 4500
001 978-3-031-57712-3
003 DE-He213
005 20240730171915.0
007 cr nn 008mamaa
008 240419s2024 sz | s |||| 0|eng d
020 _a9783031577123
_9978-3-031-57712-3
024 7 _a10.1007/978-3-031-57712-3
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aEvolutionary Computation in Combinatorial Optimization
_h[electronic resource] :
_b24th European Conference, EvoCOP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3-5, 2024, Proceedings /
_cedited by Thomas Stützle, Markus Wagner.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXI, 194 p. 41 illus.
_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 ;
_v14632
505 0 _aA Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem -- Sparse Surrogate Model for Optimization: Example of the Bus Stops Spacing Problem -- Emergence of new local search algorithms with neuro-evolution -- Q-learning Based Framework for Solving the Stochastic E-waste Collection Problem -- A memetic algorithm with adaptive operator selection for graph coloring -- Studies on Multi-objective Role Mining in ERP Systems -- Greedy heuristic guided by lexicographic excellence -- Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices Under Recombination -- Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances -- Hardest Monotone Functions for Evolutionary Algorithms -- A Theoretical Investigation Of Termination Criteria For Evolutionary Algorithms -- Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings.
520 _aThis book constitutes the referred proceedings of the 24th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2024, held as part of EvoStar 2024, in Aberystwyth, UK, during April 3-5, 2024. The 12 full papers presented in this book were carefully reviewed and selected from 28 submissions. They cover a variety of topics, ranging from constructive algorithms, machine learning techniques ranging from neural network based guidance to sparse surrogate models for optimization problems, the foundation of evolutionary computation algorithms and other search heuristics, to multi-objective optimization problems. .
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aComputer science.
_99832
650 0 _aComputer networks .
_931572
650 0 _aArtificial intelligence.
_93407
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aTheory of Computation.
_9100830
650 2 4 _aComputer Communication Networks.
_9100832
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aStützle, Thomas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100834
700 1 _aWagner, Markus.
_eeditor.
_0(orcid)
_10000-0002-3124-0061
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100835
710 2 _aSpringerLink (Online service)
_9100838
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031577116
776 0 8 _iPrinted edition:
_z9783031577130
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14632
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-57712-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c87876
_d87876