Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine

Online shopping has become one of the popular mediums for people to use online transactions due to its economical and easiness.It is more convenient to those who simply do not have time to shop physically and prefer delivery service. However, the courier services nowadays are unable to keep up with the increasing consumer demand. The problem is caused by the delivery process that is not synchronized due to the problem of finding the best route of distribution. Distributors are unable to plan their distribution path with the minimal distance.Furthermore distributors are only able to reach each district distribution centre once a day and revisit the distribution centre will increase the time spent and operation cost. This study developed Courier Delivery Services Visualisor (CDSV) that is able to visualize the best route to be taken by distributor, so that the courier service can arrive on time.CDSV employed Genetic Algorithm (GA) and Astar Algorithm (A*) that integrates with Geographical Information System (GIS) data.A graphical user interface in the form of simulation map that suggests the best route and the optimal distance are displayed for easier courier service distribution references

The x-and-y-axes travelling salesman problem

The x-and-y-axes travelling salesman problem forms a special case of the Euclidean TSP, where all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system of the Euclidean plane. By carefully analyzing the underlying combinatorial and geometric structures, we show that this problem can be solved in polynomial time. The running time of the resulting algorithm is quadratic in the number of cities. Highlights - A special solvable case of the travelling salesman problem (TSP) is considered. - All cities in this TSP are situated on the x-and-y-axes of the Euclidean plane. - The problem remained open since 1980. - The running time of our algorithm is quadratic in the number of cities