IDEAS home Printed from https://ideas.repec.org/a/ids/ijmcdm/v10y2026i3p274-293.html

Optimal parking lot selection based on bi-criteria optimisation approach

Author

Listed:
  • Semeneh Hunachew Bayih
  • Surafel Luleseged Tilahun

Abstract

One of the main causes of urban congestion is searching for vacant parking lot. The classical methods for parking lot selection are usually based solely on available vacant spots. This study introduces a novel bi-criteria method that helps drivers choose parking lots considering driving time, cost, and walking distance. Parking costs fluctuate according to demand and other factors. To handle these situations, we have developed an algorithm that uses a transition matrix and various states to predict changes in parking costs. In some cases, a decision maker finds that optimising for the total travel time and expected parking cost presents a conflict. To find the optimal trade-off between travel time and the anticipated total parking cost, a bi-objective optimisation approach has been employed. Numerical simulation is conducted in 12 parking lots with randomly generated data to show the feasibility of our approach. Through the ideal point method, the main result identifies Pareto-optimal parking lots, offering drivers an efficient way to select the appropriate parking lot.

Suggested Citation

  • Semeneh Hunachew Bayih & Surafel Luleseged Tilahun, 2026. "Optimal parking lot selection based on bi-criteria optimisation approach," International Journal of Multicriteria Decision Making, Inderscience Enterprises Ltd, vol. 10(3), pages 274-293.
    • Handle: RePEc:ids:ijmcdm:v:10:y:2026:i:3:p:274-293
    as

    Download full text from publisher

    File URL: https://www.inderscience.com/link.php?id=156722
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:ids:ijmcdm:v:10:y:2026:i:3:p:274-293. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=350 .

    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.