LEADER 05129nam 22007455 450 001 996466214603316 005 20230329195938.0 010 $a3-319-55453-0 024 7 $a10.1007/978-3-319-55453-2 035 $a(CKB)3710000001157251 035 $a(DE-He213)978-3-319-55453-2 035 $a(MiAaPQ)EBC6298857 035 $a(MiAaPQ)EBC5579162 035 $a(Au-PeEL)EBL5579162 035 $a(OCoLC)981908343 035 $a(PPN)200512358 035 $a(EXLCZ)993710000001157251 100 $a20170308d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aEvolutionary Computation in Combinatorial Optimization$b[electronic resource] $e17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings /$fedited by Bin Hu, Manuel López-Ibáñez 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XII, 249 p. 46 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10197 311 $a3-319-55452-2 320 $aIncludes bibliographical references and index. 327 $aA Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives -- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When -- Decomposing SAT Instances with Pseudo Backbones -- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control -- Estimation of Distribution Algorithms for the Firefighter Problem -- LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows -- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO -- Optimizing Charging Station Locations for Electric Car-Sharing Systems -- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier -- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants -- The Weighted Independent Domination Problem: ILP Model and Algorithmic . 330 $aThis book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10197 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aArtificial intelligence 606 $aNumerical Analysis 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aArtificial Intelligence 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aArtificial intelligence. 615 14$aNumerical Analysis. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aArtificial Intelligence. 676 $a005.432 702 $aHu$b Bin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLópez-Ibáñez$b Manuel$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466214603316 996 $aEvolutionary Computation in Combinatorial Optimization$92824693 997 $aUNISA