Discrete Flower Pollination Algorithm for Solving the Symmetric Travelling Salesman Problem.
Ryan StrangeAlice Yi YangLing ChengPublished in: SSCI (2019)
Keyphrases
- detection algorithm
- objective function
- computational complexity
- times faster
- improved algorithm
- learning algorithm
- high accuracy
- dynamic programming
- preprocessing
- np hard
- worst case
- clustering method
- cost function
- optimal solution
- classification algorithm
- optimization algorithm
- expectation maximization
- np complete
- segmentation algorithm
- lower bound
- input data
- markov random field
- matching algorithm
- k means
- computational cost