Efficient algorithms for optimal location queries in road network

Abstract

This report is base on a research paper Efficient Algorithms for Optimal Location Queries in Road Networks [1]. Given a Road Network, Data of Clients and Servers, the algorithm suggest areas on the edge where is optimize to set up a new Server.

Many companies today hopes to expand themselves to be able to reached by as many customers as possible. Expanding allow the company to built a strong brand and allowing more customer to reach where the business stretch. Growth is important for a business sustainability. There are many considerations in deciding the location to set up a new shop and using optimal location queries in road networks will help in making good decision.

This report gives three algorithms that will solve three different type of problems. An example to the first problem will be when a retail shop owner wants to open a new shop to attract most clients. The solution will be finding an area where most customers will be willing to travel to visit. The second problem will be if a delivery company wants to minimize petrol cost. The solution will be having the minimum average distance to all clients. The last problem will be if a government wants to open a new facility and aiming to decrease the traveling distance from the furthest client. The solution is to find an area where will be decrease the distance to furthest client..

The results is successful and all algorithm have achieve good performance. The correctness of the program is verified with modular testing of each part. The results had satisfy the requirement.