Evolutionary Computation in Combinatorial Optimization
-15%
portes grátis
Evolutionary Computation in Combinatorial Optimization
17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings
Hu, Bin; Lopez-Ibanez, Manuel
Springer International Publishing AG
03/2017
249
Mole
Inglês
9783319554525
15 a 20 dias
4044
Descrição não disponível.
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
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
combinatorial optimization;discrete space search;evolutionary algorithms;metaheuristics;particle swarm optimisation;algorithms;ant colony optimization;estimation of distribution algorithms;graph problem;hyper-heuristics;linear programming;matheuristics;memetic algorithm;multi-objective optimization;optimization problems;permutation problems;quadratic assignment;routing;search methodologies;vehicle routing
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
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
combinatorial optimization;discrete space search;evolutionary algorithms;metaheuristics;particle swarm optimisation;algorithms;ant colony optimization;estimation of distribution algorithms;graph problem;hyper-heuristics;linear programming;matheuristics;memetic algorithm;multi-objective optimization;optimization problems;permutation problems;quadratic assignment;routing;search methodologies;vehicle routing
