Metaheuristics to solve grouping problems: A review and a case study-Reference-Cited by-同舟云学术

Metaheuristics to solve grouping problems: A review and a case study

Published:2020-03 Issue: Volume:53 Page:100643
ISSN:2210-6502
Container-title:Swarm and Evolutionary Computation
language:en
Short-container-title:Swarm and Evolutionary Computation

Author:

Ramos-Figueroa Octavio,Quiroz-Castellanos Marcela,Mezura-Montes Efrén,Schütze Oliver

Funder

CONACyT

Universidad Veracruzana

Conacyt Basic Science

SEP

Publisher

Elsevier BV

Subject

General Mathematics,General Computer Science

Reference278 articles.

1. T. Stützle, Local Search Algorithms for Combinatorial Problems-Analysis, Algorithms and New Applications, DISKI-Dissertationen zur Künstlichen Intelligenz, Infix, Sankt Augustin, Germany.

2. D. S. Johnson, M. R. Garey, A guide to the theory of np-completeness, Computers and Intractability.

3. No free lunch theorems for optimization;Wolpert;IEEE Trans. Evol. Comput.,1997

4. A new representation and operators for genetic algorithms applied to grouping problems;Falkenauer;Evol. Comput.,1994

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

1. Application of uniform experimental design theory to multi-strategy improved sparrow search algorithm for UAV path planning;Expert Systems with Applications;2024-12

2. A comprehensive study on modern optimization techniques for engineering applications;Artificial Intelligence Review;2024-07-04

3. An adaptive particle swarm optimization with information interaction mechanism;Machine Learning: Science and Technology;2024-06-01

4. Determining the Rheological Parameters of Polymers Using Machine Learning Techniques;Modern Trends in Construction, Urban and Territorial Planning;2024-04-02

5. An experimental approach to designing grouping genetic algorithms;Swarm and Evolutionary Computation;2024-04