We are trying find the optimum route for given sets of addresses. Here optimum route meanibg going every address using shortest distance, We are using Traveling salesman approach to solve this, the problem is to work this algorithm perfectly we need distance between every pair of addresses. we can get the distance matrix using Google distance matrix/mapbox/distancematrix.ai/nextbillion.ai or any other 3rd party services. But these services are expensive.Suppose if we work with 100 addresses,then our distance matrix shape would be 100*100, so getting these 10000 pair of distance would cost us around 20$ (for google it would cost 50$ !!!!).
How can we solve this problem using most cost effective way?
