Benchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems: Dynamic Travelling Salesman Problem Benchmark Generator
Michalis Mavrovouniotis, Changhe Li, Shengxiang Yang, Xin Yao · 2013
In this report, the dynamic benchmark generator for permutation-encoded problems for the travelling salesman problem (DBGPTSP) proposed in is used to convert any static travelling salesman problem benchmark to a dynamic optimization problem, by modifying the encoding of the instance instead of the fitness landscape.