A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima

Evolutionary Computation (2020) 28 (2): 255–288.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Hybridizations of evolutionary algorithms with Large Neighborhood Search

Christian Blum
Anton Eremeev
Yulia Zakharova

Computer Science Review (2022) 46: 100512.

Genetic programming convergence

W. B. Langdon

Genetic Programming and Evolvable Machines (2022) 23 (1): 71.

GEZGİN SATICI PROBLEMİ İÇİN ARDIŞIK YEREL ARAMA İLE YENİ BİR HİBRİT GENETİK ALGORİTMA ÖNERİSİ

Osman PALA

International Journal of Management Economics and Business (2021)

KD-LBA: a Kernighan Lin-driven logarithmic barrier approach to solve the many-to-many assignment problem and its application in CPU/FPGA scheduling

Nitish Das
Aruna Priya P.

Cluster Computing (2021) 24 (4): 3101.

Artificial neural network based crossover for evolutionary algorithms

Renato Tinós

Applied Soft Computing (2020) 95: 106512.