A parallel genetic algorithm to speed up the resolution of the algorithm selection problem-Reference-Cited by-同舟云学术

A parallel genetic algorithm to speed up the resolution of the algorithm selection problem

Published:2021-07-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference Companion
language:
Short-container-title:

Author:

Marrero Alejandro¹,Segredo Eduardo¹,Leon Coromoto¹

Affiliation:

1. Universidad de La Laguna, Tenerife, SPAIN

Funder

Agencia Canaria de Investigación Innovación y Sociedad de la Información - ACIISI

panish Ministry of Science, Innovation and Universities, as well as by the University of La Laguna, as part of the programme Nuevos Proyectos de Investigación: Iniciación a la Actividad Investigadora

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3449726.3463160

Reference8 articles.

1. Introduction to Evolutionary Computing

2. A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem

3. A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem

4. Where are the hard knapsack problems?

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Descriptors for Novelty-Search Based Instance Generation via Meta-evolution;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

2. Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12

3. DIGNEA: A tool to generate diverse and discriminatory instance suites for optimisation domains;SoftwareX;2023-05

4. A Novelty-Search Approach to Filling an Instance-Space with Diverse and Discriminatory Instances for the Knapsack Problem;Lecture Notes in Computer Science;2022