nanoll extt
Please use this identifier to cite or link to this item: http://lrcdrs.bennett.edu.in:80/handle/123456789/4374
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGolash, Richa
dc.contributor.authorRishi, Siddarth
dc.contributor.authorpal, Ashutosh
dc.date.accessioned2024-05-30T10:58:20Z-
dc.date.available2024-05-30T10:58:20Z-
dc.date.issued2023
dc.identifier.issn978-93-82206-12-5
dc.identifier.urihttp://lrcdrs.bennett.edu.in:80/handle/123456789/4374-
dc.description.abstractThe "Finding Cabs Nearby Using Great Cirde Distance Formula initiative tockles the crucial problem of effectively linking consumers with local taxi services in urban transportation networks. Providing the best possible service to passengers in the ever changing ridesharing and taxi industry is crucial in today's connected world. This project offers a complete solution that uses the Great Circle Distance formula to determine exact distances between customers and available taxis, improving user experience by optimizing the allocation process. The principal aims of this project are to create a sturdy system that can compute distances via the Great Circle Distance formula, obtain real-time information from several taxi companies, and use a clever algorithm to choose the best cab assigruments. This formula's application guarantees precise distance computations, which helps with the efficient distribution of taxis among customers within a designated radius._x000D_ The Great Circle Distance formula, a foundational trigonometry concept for figuring out the separation between two points on a sphere's surface, is incorporated into the technique. The system is able to remain up to current with the dynamic nature of cab locations and availability thanks to real-time data that is gathered from many cab providers via APIs. This data includes latitude, longitude, and other pertinent information. The technical details describe how latitude. longitude. IDs, and names taken from a JSON file are stored and manipulated using data structures like arrays and variables. The algorithm parses ISON characteristics and converts string data into numeric forms by using effective string manipulation techniques. The project also reads data from the input JSON file and writes the Result to an output JSON file by using file handling methods. The system's performance is assessed in the results and analysis section, which highlights enhanced user happiness, precise taxi allocations, and faster response The project's value lies in its capacity to streamline taxi services, giving_x000D_ 64_x000D_ Understanding Data Flow in Games using C++ (Vol. II)_x000D_ customers quick access to local taxxis and supporting taxi companies in managing their resources. To sum up, "Finding Cabs Nearby Using Great Circle Distance Formula" is a big step in the right direction towand solving the problems related to effective cab allocation. The application of accurate distance computations, real time data retrieval, and a clever algorithm helps to improve taxi services. Future development may entail adding more functionality to the system, such projected arrival times, and broadening its coverage to include new cities and taxi companiesen_US
dc.publisherRawat Prakashanen_US
dc.titleCab Finder Pro: Enhancing Taxi Services with Great Circle Distanceen_US
dc.typeBook Chapteren_US
Appears in Collections:Book Chapters_ SCSET

Files in This Item:
File SizeFormat 
Ch_14_978-93-82206-12-5.pdf
  Restricted Access
4.65 MBAdobe PDFView/Open Request a copy

Contact admin for Full-Text

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.