IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v200y2025ics0191261525001675.html
   My bibliography  Save this article

Deep learning-based travel choice prediction with provable and adaptable fairness guarantees

Author

Listed:
  • Chen, Zhiwei
  • Xu, Yufei
  • Peeta, Srinivas

Abstract

Deep Learning (DL) models offer substantial potential for travel choice predictions but are often plagued by algorithmic unfairness where disadvantaged population groups such as racial minorities and low-income populations often receive disproportionately worse prediction outcomes (e.g. accuracy) compared to their counterparts. Studies to address this issue in the transportation domain are relatively new and they fail to provide provable fairness guarantees and cannot address the diverse interpretations of fairness in practice. This study introduces a novel DL approach that provides provable fairness guarantees while being adaptable to various fairness standards. It embeds statistical hypothesis testing within a practical equality constraint to control disparities in prediction accuracy across different population groups, thus providing provable and adaptable fairness guarantees. This approach results in a threshold modification problem, formulated as a mixed-integer non-linear programming model that is proven to be NP-hard. To allow for efficient problem solving, theoretical properties of the threshold modification problem are investigated, enabling the decomposition of the original problem into smaller, more manageable subproblems. This decomposition provides insights into the problem's structure and enables the development of an efficient "Accuracy-First-Threshold-Second " algorithmic framework. Within this framework, an exact solution method is proposed to achieve optimal solutions, whereas a heuristic method, incorporating a sandwich algorithm and a bounded-enumeration algorithm, is designed to efficiently approximate near-optimal solutions. Extensive experiments demonstrate the computational performance of the proposed solution algorithms as well as the ability of the proposed fair DL approach to provide provable and adaptable fairness guarantees for travel choice predictions. This study offers a flexible and theoretically robust solution to fairness in travel choice prediction, with potential applications for enhancing equity in transportation systems.

Suggested Citation

  • Chen, Zhiwei & Xu, Yufei & Peeta, Srinivas, 2025. "Deep learning-based travel choice prediction with provable and adaptable fairness guarantees," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
  • Handle: RePEc:eee:transb:v:200:y:2025:i:c:s0191261525001675
    DOI: 10.1016/j.trb.2025.103318
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261525001675
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2025.103318?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:eee:transb:v:200:y:2025:i:c:s0191261525001675. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.