Set-Based Differential Evolution for Traveling Salesman Problem


This paper is concerned with the discrete combinatorial optimization problem. A novel set-based differential evolution (SBDE) algorithm for traveling salesman problem (TSP) is proposed and evaluated. SBDE is based on a set-based representation scheme that enables SBDE to characterize the discrete search space of TSP. The candidate solution, vector and the… (More)

3 Figures and Tables


  • Presentations referencing similar topics