The Impact of AI on Delivery Businesses

You know the Travelling Salesman Problem? Find the shortest route that takes you to every city on a list and returns you home. In fact it's an NP-hard problem, where NP stands for non-deterministic polynomial time. Just in case you were in any doubt about how hard it is. But if you're a grocery retailer, delivering the weekly shopping to millions of homes, or the country's leading furniture maker... well, it's a problem you have to solve.