Discrete Firework Algorithm for Combinatorial Optimization Problem

Abstract

Considering the excellent performance of FWA for real parameter optimization problems, a novel FWA variant was proposed for tackling discrete optimization problems, especially for Travelling Salesman Problem (TSP). We first give a brief introduction to TSP, followed by the detailed description of the discrete fireworks algorithm (DFWA).