Nathan Lambson - Academia.edu (original) (raw)

Nathan Lambson

Related Authors

F Xue

F Xue

The University of Hong Kong

Malcolm Low

Dama Academic Scholarly & Scientific Research Society

Dr. Sanjay Mohapatra

Marco Dorigo

Uploads

Papers by Nathan Lambson

Research paper thumbnail of The Traveling Salesman Problem : Adapting 2-Opt And 3-Opt Local Optimization to Branch & Bound Techniques

The Travelling Salesmen Problem has captured the attention and resources of both the academic and... more The Travelling Salesmen Problem has captured the attention and resources of both the academic and business world. In an effort to discover new, and effective strategies to solve TSP, our team adapted well known TSP strategies with optimization techniques to create a unique algorithm capable of solving this complex problem. The algorithm is based on the 2-Opt and 3-Opt local search optimization algorithms and used in conjunction with a modified branch and bound algorithm. The result is a unique algorithm which is capable of solving an ATSP (asymmetrical travelling salesman problem) of 300 cities in approximately 12 minutes. The algorithm gradually improved the solutions path length as compared to the greedy solution until it capped at approximately 26% for TSPs with 100+ cities.

Research paper thumbnail of The Traveling Salesman Problem : Adapting 2-Opt And 3-Opt Local Optimization to Branch & Bound Techniques

The Travelling Salesmen Problem has captured the attention and resources of both the academic and... more The Travelling Salesmen Problem has captured the attention and resources of both the academic and business world. In an effort to discover new, and effective strategies to solve TSP, our team adapted well known TSP strategies with optimization techniques to create a unique algorithm capable of solving this complex problem. The algorithm is based on the 2-Opt and 3-Opt local search optimization algorithms and used in conjunction with a modified branch and bound algorithm. The result is a unique algorithm which is capable of solving an ATSP (asymmetrical travelling salesman problem) of 300 cities in approximately 12 minutes. The algorithm gradually improved the solutions path length as compared to the greedy solution until it capped at approximately 26% for TSPs with 100+ cities.

Log In