Quotient algorithm: a simple heuristic for the travelling salesperson problem inspired by human solutionsKyritsis, M., Ud Din, S. and Gulliver, S. (2018) Quotient algorithm: a simple heuristic for the travelling salesperson problem inspired by human solutions. In: 2018 Fifth HCT Information Technology Trends (ITT), 28-29 Nov 2018, Dubai, United Arab Emirates, pp. 47-49.
It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing. Official URL: https://ieeexplore.ieee.org/document/8649545 Abstract/SummaryThe Travelling Salesperson Problem (TSP) is a classic example of a non-polynomial (NP) hard problem, which cannot be practically solved using exhaustive algorithmic approaches. This study explores the human approach, and presents a Quotient Algorithm (Quot) - a modification to the nearest neighbor algorithm - inspired by human path crossing avoidance behavior when solving ETSP graphs. We compared the developed Quot results against standard heuristic algorithms and found that this simple modification outperforms the NN, as well as other existing heuristic approaches
Download Statistics DownloadsDownloads per month over past year Related URLs Deposit Details University Staff: Request a correction | Centaur Editors: Update this record |
Lists
Lists
