Open Access   Article Go Back

Reducing Traffic in Smart Cities by using Shortest Path Algorithms

B.V.V.S. Padmasripriya1 , Chandra Mouli P.V.S.S.R.2

  1. School of Computer Science and Engineering, VIT University, Vellore, India.
  2. School of Computer Science and Engineering, VIT University, Vellore, India.

Correspondence should be addressed to: padmasripriya17@gmail.com.

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-5 , Page no. 201-208, May-2017

Online published on May 30, 2017

Copyright © B.V.V.S. Padmasripriya, Chandra Mouli P.V.S.S.R. . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: B.V.V.S. Padmasripriya, Chandra Mouli P.V.S.S.R., “Reducing Traffic in Smart Cities by using Shortest Path Algorithms,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.201-208, 2017.

MLA Style Citation: B.V.V.S. Padmasripriya, Chandra Mouli P.V.S.S.R. "Reducing Traffic in Smart Cities by using Shortest Path Algorithms." International Journal of Computer Sciences and Engineering 5.5 (2017): 201-208.

APA Style Citation: B.V.V.S. Padmasripriya, Chandra Mouli P.V.S.S.R., (2017). Reducing Traffic in Smart Cities by using Shortest Path Algorithms. International Journal of Computer Sciences and Engineering, 5(5), 201-208.

BibTex Style Citation:
@article{Padmasripriya_2017,
author = {B.V.V.S. Padmasripriya, Chandra Mouli P.V.S.S.R.},
title = {Reducing Traffic in Smart Cities by using Shortest Path Algorithms},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2017},
volume = {5},
Issue = {5},
month = {5},
year = {2017},
issn = {2347-2693},
pages = {201-208},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1290},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1290
TI - Reducing Traffic in Smart Cities by using Shortest Path Algorithms
T2 - International Journal of Computer Sciences and Engineering
AU - B.V.V.S. Padmasripriya, Chandra Mouli P.V.S.S.R.
PY - 2017
DA - 2017/05/30
PB - IJCSE, Indore, INDIA
SP - 201-208
IS - 5
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
548 411 downloads 486 downloads
  
  
           

Abstract

Information is spread all through the city requiring little to no effort and ready to divert vehicles in development in the city to at long last accomplish shorter travel times and less congested driving conditions in smart communities. The Wi-Fi network is empowered for the driver terminals, because of that they can easily find the routes. This application proposes a constant framework for recommending appropriated customized courses in keen smart areas. The application need to collect the traffic data of past and the present data of the city. The driver hubs will get the briefest courses to the goal, if there is no immediate course to the goal then the calculation will get all the info roads which are specifically reachable from the present area to the goal. Shortest path algorithm like Warshall Floyd is used to find the optimal path to destination. The main aim of this approach is to increase the citizens’ life.

Key-Words / Index Term

Vehicular Ad-hoc Network (VANET), Mobile Ad-hoc Network (MANET, Ant Colony Optimization Algorithm (ACO), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Warshall Floyd

References

[1] Tsu-Wei Chen, M. Gerla, "Global state routing: a new routing scheme for ad-hoc wireless networks", Communications, 1998. ICC Conference Record 1998 IEEE International Conference on, Atlanta, , pp. 171-175, 1998.
[2] Stützle, Thomas, Holger H. Hoos, "MAX–MIN ant system", Future generation computer systems, Volume 16, Issue.1, pp.889-914, 2000.
[3] Pei Guangyu, Mario Gerla, Tsu-Wei Chen, "Fisheye state routing: A routing scheme for ad hoc wireless networks", IEEE International Conference on Communications, USA, pp. 70-74. 2000.
[4] Di Caro, Gianni, Frederick Ducatelle, Luca Gambardella. "AntHocNet: an ant-based hybrid routing algorithm for mobile ad hoc networks", Parallel Problem Solving from Nature-PPSN VIII, Barlin, pp. 461-470, 2004.
[5] J. Amudhavel, "Effective maintenance of replica in distributed network environment using DST", International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom), USA, pp.252,254, 2010.
[6] Krajzewicz, Daniel, "Traffic simulation with SUMO–simulation of urban mobility", Fundamentals of traffic simulation, New York, pp. 269-293, 2010.
[7] T.A. Sebaey, "Ant colony optimization for dispersed laminated composite panels under biaxial loading", Composite Structures, Vol.94, Issue.1, pp. 31-36, 2011.
[8] H. Hemmatian, "Optimization of laminate stacking sequence for minimizing weight and cost using elitist ant system optimization", Advances in engineering Software, Vol..57, Issue.8, pp.8-18, 2013.
[9] DH. Stolfi, Enrique Alba, "Reducing gas emissions in smart cities by using the Red Swarm architecture", Conference of the Spanish Association for Artificial Intelligence, Berlin, pp. 289-299, 2013.
[10] D. Vaibhav, R. Atul R, "Performance Improvement of Routing Protocol Using Two Different Mobility Models In Vehicular Adhoc Vehicular Network", International Journal of Computer Science and Mobile Computing, Vol. 3, Issue.4 pp. 440-445, 2014.
[11] S. Bououden, M. Chadli, HR. Karimi, "An ant colony optimization-based fuzzy predictive control approach for nonlinear processes", Information Sciences, Volume 29, Issue.9, pp.143-158, 2015.