Analysis of Petrol Pumps Reachability in Anand District of Gujarat

Nidhi Arora

Abstract


The problem of finding shortest path in a network has been studied by many researchers over the years. Most of the research works have proposed algorithms for finding the shortest route in a network. This work serves dual purpose; it not only aims to gain the high-level familiarity with availability of petrol pumps in the residential areas in Anand district, but also suggest the shortest route to reach a petrol pump from any location. The initial target areas for this analysis are the residential areas around Anand in Gujarat. Quantum GIS has been used to perform analysis of petrol pump reachability from a random place in Anand to a nearest located petrol pump and to identify the shortest path between the two locations. Results of comparison confirm the feasibility and robustness of proposed methodology which shows its potential application in real road networks.

Keywords


shortest path, GIS, transportation, road networks

Full Text:

PDF

References


Ahn, C.W. and Ramakrishnal, R.S. (2002), A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations, IEEE Transactions on Evolutionary Computation, pp. 566-579.

Beardwood, J., Halton, J.H. and Hammersley, J.M. (2008), The shortest path through many points, Mathematical Proceedings of the Cambridge Philosophical Society, 55(4), pp. 299–327.

Comber A., Brunsdon C., Green E. (2008), Using a GIS-based network analysis to determine urban greenspace accessibility for different ethnic and religious groups, Landscape and Urban Planning, 86(1), pp. 103-114.

Dean D.J. (1997), Finding optimal routes for networks of harvest site access roads using GIS-based techniques, Canadian Journal of Forest Research, 27(1), pp. 11-22.

Goldberg A.V., Harrelson C. (2005), Computing the shortest path: A search meets graph theory, In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 156-165.

Inagaki J., Haseyama M. and Kitajima H. (1999), A genetic algorithm for determining multiple routes and its applications, Proc. IEEE International Symposium on Circuits and Systems, 6, pp. 137-140.

Kruskal, J. (1956), On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proceedings of the American Mathematical Society, 7(1), pp. 48-50.

Kyushik Oh, Seunghyun J. (2007), Assessing the spatial distribution of urban parks using GIS, Landscape and Urban Planning, 82(1–2), Pages 25-32.

Liu, S. and Zhu, X. (2004), An Integrated GIS Approach to Accessibility Analysis. Transactions in GIS, 8, pp. 45–62.

Munemoto M., Takai Y. and Sato, Y. (1999), A migration scheme for the genetic adaptive routing algorithmâ€, Proc. IEEE Int. Symp. Circuits and Systems, pp. 137-140.

Pijanowski B.C., Brown D.G., Shellito B.A., Manik G.A. (2002), Using neural networks and GIS to forecast land use changes: a Land Transformation Model, Computers, Environment and Urban Systems, 26(6), pp. 553-575.

Zhan B.F., Charles E. N. (1998), Shortest Path Algorithms: An Evaluation Using Real Road Networks, Transportation Science, 32(1), pp. 65-73.

Zhang J., Zhao X. and He X. (2014), A Minimum Resource Neural Network Framework for Solving Multi-constraint Shortest Path Problems, Neural Networks and Learning Systems IEEE Transactions on, 25, pp. 1566-1582.


Refbacks

  • There are currently no refbacks.


ISSN: 1694-2507 (Print)

ISSN: 1694-2108 (Online)