ABSTRACT
This chapter identifies the best delivery route for a delivery company. This is a traditional travelling salesman problem which aims to find a route that minimises the total distance travelled.
A theoretic description of neighbourhood search and a specific consideration of the “2-opt” algorithm are given. These are types of heuristic algorithms which may not guarantee optimality but can often perform better in practice than exact approaches.
The standard Python library and base R are used to build these algorithms.
