The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem

作者：

Highlights：

• Considering weak mechanism of exploitation in the HS, HSIHM algorithm is proposed.

• Our modification allowed to limit summary average error from 13.42 to 5.54%.

• Simultaneously, using 2-opt swap and swap operations in HSIHM is recommended.

• The empirical results show that the HSIHM creates better solutions than the HS.

摘要

•Considering weak mechanism of exploitation in the HS, HSIHM algorithm is proposed.•Our modification allowed to limit summary average error from 13.42 to 5.54%.•Simultaneously, using 2-opt swap and swap operations in HSIHM is recommended.•The empirical results show that the HSIHM creates better solutions than the HS.

论文关键词：Harmony Search with harmony memory improvement,Harmony Search,Asymmetric Traveling Salesman Problem

论文评审过程：Received 21 June 2018, Revised 19 November 2018, Accepted 22 December 2018, Available online 23 December 2018, Version of Record 29 December 2018.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.12.044