Evolutionary Computation in Combinatorial Optimization [E-Book] : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / edited by Bin Hu, Manuel López-Ibáñez.
Hu, Bin, (editor)
López-Ibáñez, Manuel, (editor)
Cham : Springer International Publishing, 2017
XII, 249 p. 46 illus. online resource.
englisch
9783319554532
10.1007/978-3-319-55453-2
Lecture notes in computer science ; 10197
Full Text
Table of Contents:
  • A 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 .