Discrete Flower Pollination Algorithm for Solving the Symmetric Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is an important NP-hard combinatorial optimisation problem that forms the foundation of many modern-day, practical problems such as logistic or network route planning. The Flower Pollination Algorithm (FPA) is a continuous optimisation algorithm that demonstrate...

Full description

Saved in:
Bibliographic Details
Published in:2019 IEEE Symposium Series on Computational Intelligence (SSCI) pp. 2130 - 2137
Main Authors: Strange, Ryan, Yang, Alice Yi, Cheng, Ling
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2019
Subjects:
Benchmark testing
flower pollination algorithm
Genetic algorithms
heuristic algorithm
Heuristic algorithms
nature inspired algorithm
NP-hard problem
Optimization
Routing
Task analysis
traveling salesman problem
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Travelling Salesman Problem (TSP) is an important NP-hard combinatorial optimisation problem that forms the foundation of many modern-day, practical problems such as logistic or network route planning. The Flower Pollination Algorithm (FPA) is a continuous optimisation algorithm that demonstrated promising results in comparison to other wellknown algorithms. This paper proposes a novel algorithm, Discrete Flower Pollination Algorithm (DFPA) based on the FPA for solving the TSP. The algorithm is compared to the Ant Colony Optimisation's (ACO) MAX-MIN Ant System (MMAS) as well as the Genetic Algorithm (GA) since they are well studied and developed. The DFPA results are significantly better than the GA in all tested instances.
DOI:10.1109/SSCI44817.2019.9002797