Vehicle Routing

The Makati Route Finder System focuses on the route finding problem of the transportation industry. It finds the shortest route between two road junctions in Makati by implementing the Dijkstra’s Shortest Path algorithm. This shortest path problem has many variants and one of these is the Vehicle Routing Problem.

Suppose a certain company in Makati would want to deliver quantities of goods to ten customers within the city and it has six delivery vehicles which can carry a fixed number of goods. The company may deploy all six vehicles without a plan of route as long as the ten customers are serviced. This, however, may lead to longer distances traveled by the delivery vehicles and this does not help maximize the company’s profit as it makes the costs of operations high. The number of...