Crossmark

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

Crossref DOI link: https://doi.org/10.1007/s12293-019-00291-4

Published Online: 2019-07-01

Published Print: 2020-03

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Eremeev, Anton V. https://orcid.org/0000-0001-5289-7874
Kovalenko, Yulia V. https://orcid.org/0000-0003-4791-7011
License Information

Text and Data Mining valid from 2019-07-01

Version of Record valid from 2019-07-01
More Information

Article History

Received: 5 October 2018

Accepted: 26 June 2019

First Online: 1 July 2019