Most navigable path using landmarks

Abstract

In this paper we will be mentioning the various facets of our research project. We will go through the need to solve the problem of navigability and its relevance to today’s world. We have compared this model to the existing relevant models such as the scenic route, and the happy route model. Then we will be stepping into the technical details of the scenic model to help us classify our problem giving it a concise structure. To further clarify the details of this conceptualization, we will be mentioning the various prospects of research paper based on scenic routing algorithm. Establishing the prerequisites to the problems we will elaborate ILS as a concept and go through the functioning of it. We have implemented our own version of ILS according to our problem statements. The main segregating pitch in the problem statement is the avoidance of loops while calculating the navigable path. We will discuss the problems in the approaches studied, their mitigation and the algorithms developed by us to account for them. Also, we will be going into experimentation's based on our own data sets. We will lay down the algorithms proposed by us, and in one case the reason for not using a certain variant of an algorithm. Other than that we will be talking about the heuristics we have proposed to lay down on top of the ILS implementation to quicken our algorithm. One major prospect we have worked upon is the spatial feature integration in our road network. We have implemented a grid _le structure to account for our range queries. We will be using a pruning methodology to shorten our graph for each of the query. From there on we will look into the implementation of the algorithms implemented by us, compare and contrast the results so generated. Main, focus has been on removal of loops from the given ILS implementation and also the inculcation of the heuristic proposed by us. Finally, we will be showing the results of our experiments, and compare the scores we get due to the various algorithms implemented by us. We will be showing the scores generated by division based algo, Yen's based algo, ILS, ILS (P) and its variants. Inside ILS we will be using different bucket sizes for our grid file structure, to find the best bucket size based on the different data sets.