Dynamic multiscale region search algorithm using vitality selection for traveling salesman problem

作者：

Highlights：

• Dynamic multiscale region search using vitality selection is proposed for TSP.

• Dynamic-variable and multiscale search rules are different from strong-fixed rules.

• Vitality selection selects an individual by its progress, not only by its fitness.

• The objective of vitality selection is to maximize the match of other operators.

摘要

•Dynamic multiscale region search using vitality selection is proposed for TSP.•Dynamic-variable and multiscale search rules are different from strong-fixed rules.•Vitality selection selects an individual by its progress, not only by its fitness.•The objective of vitality selection is to maximize the match of other operators.

论文关键词：Traveling salesman problem,Dynamic multiscale region search algorithm,Variable neighborhood search,Dynamic-variable search rules,Vitality selection,Delete-oldest selection

论文评审过程：Received 9 March 2015, Revised 2 May 2016, Accepted 2 May 2016, Available online 7 May 2016, Version of Record 12 May 2016.

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