IDEAS home Printed from https://ideas.repec.org/a/jbo/ijsrml/v1y2025i4id40.html

A Comparative Study of Different Algorithms used in Parking Availability Prediction

Author

Listed:
  • Upasana Mehta
  • Jeegar Trivedi
  • Priti Sajjja

Abstract

In metro cities, congested streets are a serious issue. In recent years, many cities have faced far more issues than in the past, particularly those linked to people movement and land use. One of the most difficult challenges is to solve parking management, which connects transportation and land use. When there aren't enough parking spaces, especially during rush hour, parking might be a pain. The scarcity and management of parking places are the most significant challenges. This is due to unfulfilled demand as a result of a lack of parking spots and inefficient use of existing facilities. In most large cities, finding a parking place is difficult, especially in the mega city. It is estimated that vehicles spend half an hour on average looking for a parking spot. As a result, the purpose of this study is to assist the parking management team in improving the efficiency of the parking spaces available in order to optimize the parking area. In this paper, we present a comparative study of different parking availability predication algorithms.

Suggested Citation

  • Upasana Mehta & Jeegar Trivedi & Priti Sajjja, 2025. "A Comparative Study of Different Algorithms used in Parking Availability Prediction," Int. J. Sci. Res. Artif. Intell. Mach. Learn, International Journal of Scientific Research in Artificial Intelligence and Machine Learning, vol. 1(4), pages 58-64, August.
    • Handle: RePEc:jbo:ijsrml:v1:y2025:i4:id:40
    Note: Article URL: https://ijsraiml.com/home/article/view/IJSRAIML25147
    as

    Download full text from publisher

    File URL: https://ijsraiml.com/home/article/view/IJSRAIML25147
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsraiml.com/home/article/download/IJSRAIML25147/IJSRAIML25147
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbo:ijsrml:v1:y2025:i4:id:40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsraiml.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.