A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem

Journal

Memetic Computing
ISSN: 1865-9284 , E-ISSN: 1865-9292

Output data

Year: 2020, Volume: 12, Pages: 23–36 Pages count : DOI: 10.1007/s12293-019-00291-4

Tags

Optimal recombination; Local search; Restart rule; Computational experiment

Authors

Eremeev Anton V. ^1,2 , Kovalenko Yulia V. ¹

Affiliations

1	Omsk Department, Sobolev Institute of Mathematics SB RAS
2	ИНИОН РАН

Eremeev A.V. , Kovalenko Y.V.
A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem
Memetic Computing. 2020. V.12. P.23–36. DOI: 10.1007/s12293-019-00291-4 WOS Scopus OpenAlex

Submitted:	Oct 5, 2018
Published online:	Jul 1, 2019