Skip to main content

Advertisement

Log in

Determination of least polluted route using Dijkstra’s algorithm

  • Original Paper
  • Published:
International Journal of Environmental Science and Technology Aims and scope Submit manuscript

Abstract

The increasing amount of air pollution on a global scale is a major source of worry. The elevated levels of pollution are affecting the health of urban dwellers and motorists to a great extent. Since the situation has become so dire, it has become an absolute necessity to find effective ways to reduce air pollution and mitigate the negative effects of air pollution on human health. In this paper, the task of determining the least polluted route is addressed and how this can be used to curb pollution is discussed. The proposed work uses Dijkstra’s algorithm, suggests a weight selection metric for air pollution parameters and analyzes the efficacy of the proposed algorithm in determining the least polluted route. The algorithm is tested on real-time data extracted from the Central Pollution Control Board, a statutory organization under the Ministry of Environment, Forest and Climate Change, Government of India. From the results obtained, it is found that the least polluted routes between a given source location and other different locations of a city can be determined using Dijkstra’s algorithm accurately and the algorithm has a time complexity of O(V2). Further, using a least polluted route map will help motorists take less polluted routes, diverting air pollution off congested streets and enabling national governments to create policies like constructing flyovers or widening roads in increasingly polluted areas.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

Download references

Acknowledgements

The Central Pollution Control Board (CPCB) of India, a statutory agency under the Ministry of Environment, Forest, and Climate Change (Mo. E.F.C) is gratefully acknowledged by the author for making air pollution data freely available required for this research work. The author is also thankful to Bhaskaracharya College of Applied Sciences, University of Delhi, for providing the infrastructural support.

Funding

I declare that no funds, grants, or other financial support were received during the preparation of this manuscript.

Author information

Authors and Affiliations

Authors

Contributions

Full contribution of the Corresponding author at all levels.

Corresponding author

Correspondence to B. Deep.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Editorial responsibility: Chenxi Li.

This paper presents a unique criterion of weight selection parameter used in Dijkstra’s algorithm and the proposed approach can be used for the determination of Least Polluted Route. The unique selection criterion of weight ensures that no negative cycles are generated while the Dijsktra’s algorithm is running. The methodology is detailed and obtained output results are found to be in order and accurate.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deep, B. Determination of least polluted route using Dijkstra’s algorithm. Int. J. Environ. Sci. Technol. 20, 13289–13298 (2023). https://doi.org/10.1007/s13762-022-04750-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13762-022-04750-3

Keywords

Navigation