IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i5p1439-1457.html
   My bibliography  Save this article

Ridesharing in urban areas: multi-objective optimisation approach for ride-matching and routeing with commuters’ dynamic mode choice

Author

Listed:
  • Lei Guan
  • Jun Pei
  • Xinbao Liu
  • Zhiping Zhou
  • Panos M. Pardalos

Abstract

The daily home-office commute of millions of people in crowded cities strains air quality and increases travel time, which motivates the generation of ridesharing. Ridesharing offers many benefits, such as reducing travel costs, congestion, and pollution. Commuter ridesharing is an important theme of urban transportation. This paper studies a ridesharing problem aiming at enlarging the ridesharing market at a limited cost, which enlighten the decision-making problem in city logistics. We establish a novel multi-objective optimisation model based on cumulative prospect theory (CPT) to address the preferred travel mode of commuters. The commuters’ perceived value influences their choice of travel mode. Meanwhile, the perceived value changes with the commuters’ experience of travel mode choice. We give the NP-hardness proof of the ridesharing scheduling problem and develop a heuristic algorithm to solve it in a small-scale scenario. For large-scale problems, a hybrid VNS-NSGAII algorithm combining variable neighbourhood search (VNS) with NSGAII (Non-dominated Sorting Genetic Algorithm II) is proposed to generate an approximate optimal Pareto front. A series of computational experiments are conducted to demonstrate the effectiveness and efficiency of the proposed algorithm based on the actual traffic data in Beijing, China.

Suggested Citation

  • Lei Guan & Jun Pei & Xinbao Liu & Zhiping Zhou & Panos M. Pardalos, 2022. "Ridesharing in urban areas: multi-objective optimisation approach for ride-matching and routeing with commuters’ dynamic mode choice," International Journal of Production Research, Taylor & Francis Journals, vol. 60(5), pages 1439-1457, March.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:5:p:1439-1457
    DOI: 10.1080/00207543.2020.1859635
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1859635
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2020.1859635?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 search for a different version of it.

    More about this item

    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:taf:tprsxx:v:60:y:2022:i:5:p:1439-1457. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.