Discrete Flower Pollination Algorithm for solving the symmetric Traveling Salesman Problem

Discrete Flower Pollination Algorithm for solving the symmetric Traveling Salesman Problem

A dissertation submitted in fulfilment of the requirements for the degree of Masters of Science in Engineering (Electrical) to the Faculty of Engineering and the Built Environment, University of the Witwatersrand, Johannesburg, 2017 === The Travelling Salesman Problem (TSP) is an important NP-hard c...

Full description

Bibliographic Details
Main Author: Strange, Ryan
Format: Others
Language:en
Published: 2018
Subjects:
Algorithms > Data processing
Discrete-time systems
Manufacturing processes
Online Access:Strange, Ryan (2017) Discrete Flower Pollination Algorithm for solving the symmetric Traveling Salesman Problem, University of the Witwatersrand, Johannesburg, <http://hdl.handle.net/10539/23622>
http://hdl.handle.net/10539/23622

Internet

Strange, Ryan (2017) Discrete Flower Pollination Algorithm for solving the symmetric Traveling Salesman Problem, University of the Witwatersrand, Johannesburg, <http://hdl.handle.net/10539/23622>
http://hdl.handle.net/10539/23622

Similar Items