IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v210y2026ics1366554526001225.html

Two-stage optimization of robotaxi dispatch via recommendation of pick-up/drop-off points and boarding time

Author

Listed:
  • Li, Mengqi
  • Qi, Liang
  • Luan, Wenjing
  • Ann Talukder, Qurra Tul
  • Guo, Xiwang
  • Liu, Lu

Abstract

As autonomous driving technology reaches a more advanced stage, robotaxis are poised to become a highly promising option for urban mobility. When passengers opt for carpooling, their requested origins/destinations and boarding time (BT) may lead to inefficient robotaxi dispatch. This paper studies a novel robotaxi dispatch problem to recommend pick-up and drop-off (PUDO) points and BT that differ from the requested ones for passengers, considering passenger willingness, i.e., whether to accept these recommendations or not. However, one-stage optimization cannot formulate the realistic decision-making behavior of passengers. To address this issue, a two-stage method is proposed to solve the problem. In the first stage, the PUDO points and BT are optimized and recommended to passengers. In the second stage, with passenger willingness, the routes of robotaxis are planned to optimize travel efficiency. The two stages are formulated as Mixed Integer Programming (MIP) models solved by two algorithms based on Nondominated Sorting Genetic Algorithm II (NSGA-II). The first algorithm is called Nondominated Sorting Genetic Algorithm II via Mass Center (NSGA-MC). It includes a trip similarity determination strategy, a segmented encoding process, and a three-operation evolution to update each fragment of the solution, and introduces a mass center for obtaining a high-quality solution. The second is a Nondominated Sorting Genetic Algorithm II with Improved Evolution (NSGA-IE). It involves an integer encoding process, a new evolution operator for route planning, and a post-iteration selection to choose a final solution from the Pareto-optimal set. The proposed algorithms can balance the conflicting objectives of maximizing the profit per kilometer of robotaxis and minimizing the total travel expense of passengers. The validity of the proposed model is confirmed by an exhaustive search method and a commercial solver CPLEX. The experimental results demonstrate that the proposed algorithms effectively determine feasible solutions and outperform NSGA-II and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) across multiple performance metrics. An ablation study illustrates the benefits of the recommendation of PUDO points and BT. Furthermore, a sensitivity analysis examines the full range of passenger willingness to accept recommendations, ranging from 0 to 100%, with intervals of 25%. Consequently, the proposed method effectively reduces the travel cost for passengers and increases the revenue of robotaxi companies. This work can actively prepare and promote the adoption of robotaxis in our real life, thereby contributing to the advancement of intelligent public transportation services.

Suggested Citation

  • Li, Mengqi & Qi, Liang & Luan, Wenjing & Ann Talukder, Qurra Tul & Guo, Xiwang & Liu, Lu, 2026. "Two-stage optimization of robotaxi dispatch via recommendation of pick-up/drop-off points and boarding time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 210(C).
  • Handle: RePEc:eee:transe:v:210:y:2026:i:c:s1366554526001225
    DOI: 10.1016/j.tre.2026.104783
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2026.104783?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:transe:v:210:y:2026:i:c:s1366554526001225. 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/600244/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.