Open Access Open Access  Restricted Access Subscription or Fee Access

Logical Hierarchy Progression Using Fuzzy Implication Technique for Real Time Route Regulation

S. Anbulakshmi, K.  Elavarasi

Abstract


An ideal course looks capacity in the in-vehicle directing direction framework. For a Dynamic Course Direction Framework (DRGS), it ought to give dynamic steering counsel taking into account continuous activity data and movement conditions, for example, clog and roadwork. We propose to utilize a stochastic pursuit strategy called fluffy rationale guided hereditary calculations (FLGA) to take care of the issue. To understand the DRGS, this paper proposes the investigative Progressive System Process (PSP) utilizing a fluffy derivation procedure in light of the ongoing movement data. The progression structure of the AHP–FUZZY methodology can extraordinarily rearrange the meaning of a choice procedure and expressly speak to the various criteria, and the fluffy surmising strategy can deal with the dubiousness and instability of the characteristics and adaptively create the weights for the framework. In a genuine domain, drivers pick the most limited course to achieve a destination since they expect that it ought to require the briefest investment to venture to every part of the briefest course. On the other hand, if a few occasions, for example, movement blockages, mishaps happen in the most brief course, the voyaging time spent on this course can be more noteworthy than that on the more drawn out course.


Keywords


Steganography, Text Hiding in Image and Audio, String Transformation

Full Text:

PDF

References


I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In P. M. Pardalos and S. Rebennack, editors, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), volume 6630 of Lecture Notes in Computer Science, pages 230{241. Springer, 2011.

I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. Hierarchical Hub Labelings for Shortest Paths. In L. Epstein and P. Ferragina, editors, Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12), volume 7501 of Lecture Notes in Computer Science, pages 24{35. Springer, 2012.

I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. Alternative Routes in Road Networks. ACM Journal of Experimental Algorithmics, 18(1):1{17, 2013.

J. Arz, D. Luxen, and P. Sanders. Transit Node Routing Reconsidered. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), volume 7933 of Lecture Notes in Computer Science, pages 55{66. Springer, 2013.

H. Bast, S. Funke, and D. Matijevic. Ultrafast Shortest-Path Queries via Transit Nodes. In C. Demetrescu, A. V. Goldberg, and D. S. Johnson, editors, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book, pages 175{192. American Mathematical Society, 2009.

H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316(5824):566, 2007.

G. V. Batz, R. Geisberger, P. Sanders, and C. Vetter. Minimum Time-Dependent Travel Times with Contraction Hierarchies. ACM Journal of Experimental Algorithmics, 18(1.4):1{43, April 2013.

R. Bauer, T. Columbus, B. Katz, M. Krug, and D. Wagner. Preprocessing Speed-Up Techniques is Hard. In Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10), volume 6078 of Lecture Notes in Computer Science, pages 359{370. Springer, 2010.

R. Bauer, T. Columbus, I. Rutter, and D. Wagner. Search-Space Size in Contraction Hierarchies. In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13), volume 7965 of Lecture Notes in Computer Science, pages 93{104. Springer, 2013.

R. Bauer and D. Delling. SHARC: Fast and Robust Unidirectional Routing. ACM Journal of Experimental Algorithmics, 14(2.4):1{29, August 2009. Special Section on Selected Papers from ALENEX 2008

R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics, 15(2.3):1{31, January 2010. Special Section devoted to WEA'08.

R. Bellman. On a Routing Problem. Quarterly of Applied Mathematics, 16:87{90, 1958.

Cambridge Vehicle Information Technology Ltd. Choice Routing, 2005. Available at http://www.camvit.com.

D. Delling, A. V. Goldberg, A. Nowatzyk, and R. F. Werneck. PHAST: Hardware-accelerated shortest path trees. Journal of Parallel and Distributed Computing, 73(7):940{952, 2013.

D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable Route Planning. In P. M. Pardalos and S. Rebennack, editors, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), volume 6630 of Lecture Notes in Computer Science, pages 376{387. Springer, 2011.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.