IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i9p1355-d1385764.html
   My bibliography  Save this article

Ride-Hailing Matching with Uncertain Travel Time: A Novel Interval-Valued Fuzzy Multi-Objective Linear Programming Approach

Author

Listed:
  • Sudradjat Supian

    (Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Padjadjaran, Sumedang 45363, Indonesia)

  • Subiyanto

    (Department of Marine Science, Faculty of Fishery and Marine Science, Universitas Padjadjaran, Sumedang 45363, Indonesia)

  • Tubagus Robbi Megantara

    (Doctoral Program in Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Padjadjaran, Sumedang 45363, Indonesia)

  • Abdul Talib Bon

    (Department of Production and Operations, Universiti Tun Hussein Onn Malaysia, Johor 86400, Malaysia)

Abstract

This study introduces an innovative approach to tackle multi-objective linear programming (MOLP) problems amidst uncertainty, employing interval-valued fuzzy numbers. The method is tailored to resolve ride-hailing matching challenges encompassing uncertain travel times. Findings reveal that managing uncertainty parameters within interval-valued fuzzy MOLP is achieved through strategic reformulations, focusing on constraint coefficients, resulting in streamlined linear programming formulations conducive to solution simplicity. The efficacy of the proposed model in efficiently handling ride-hailing matching quandaries is demonstrated. Moreover, this study delves into the prospective applications of the developed method, including its potential for generalization to address non-linear programming (NLP) issues pertinent to the ride-hailing domain. This research advances decision-making processes under uncertainty and paves the way for broader applications beyond ride-hailing.

Suggested Citation

  • Sudradjat Supian & Subiyanto & Tubagus Robbi Megantara & Abdul Talib Bon, 2024. "Ride-Hailing Matching with Uncertain Travel Time: A Novel Interval-Valued Fuzzy Multi-Objective Linear Programming Approach," Mathematics, MDPI, vol. 12(9), pages 1-17, April.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:9:p:1355-:d:1385764
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/9/1355/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/9/1355/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:9:p:1355-:d:1385764. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.