The Travelling Salesperson-Problem
Imagine you were a dispatcher and had to decide the order in which your driver should drive to five different customers. Not a big problem, is it? In fact, there are already 120 different solutions for this simple planning problem and therefore 120 routes. If the number of customers triples, the number of routes rises to an incredible amount of 1.3 trillion. This illustration shows a dilemma, also known as the “travelling salesperson problem”.
This mathematical simplification occurs rarely in logistics, because usually there are numerous other restrictions and factors that influence the planning of a tour. These factors could be: fixed delivery dates, different opening hours, different vehicles in terms of capacity and equipment or customer and goods-specific requirements. If such factors must be considered during route optimisation, the number of routes is going to be limited, but additional complexity will be created.
In addition, there is no such thing as “a best tour” for route planning, but various (optimised) options, e.g. the fastest, shortest or cheapest tour. In order to determine the “most efficient” tour, various criteria must be taken into account, such as distance, travel and service time, toll charges or driver and vehicle capacity utilisation.