IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v335y2024i1d10.1007_s10479-023-05474-4.html
   My bibliography  Save this article

Branch and price algorithm for route optimization on customized bus service

Author

Listed:
  • Xueting He

    (Shanghai University)

  • Zhiyuan Yang

    (Shanghai University)

  • Tianyi Fan

    (Shanghai University)

  • Jiajing Gao

    (Shanghai University)

  • Lu Zhen

    (Shanghai University)

  • Junyan Lyu

    (Shanghai University)

Abstract

As an innovative public transport, the customized bus has rapidly grown. To improve the efficiency of customized bus and satisfy customers’ personal requirement, a mixed-integer programming model is proposed to optimize the stop assignment for customers and route scheduling for buses with walking distance constraints and travel time constraints. As an variants of vehicle routing problem, the formulated model on large-scale instances is intractable to solve for commercial solvers. Therefore, an exact algorithm based on branch and price is developed to solve the model, in which a labeling algorithm is designed for the pricing problems. Numerical experiments and a real-world case in Dalian are conducted to validate the effectiveness of the proposed model. The computational results show that the tailored algorithm can yield an optimal solution within a significantly shorter time than that of CPLEX. Some managerial implications are also obtained based on sensitivity analysis, which may be potentially useful for bus companies.

Suggested Citation

  • Xueting He & Zhiyuan Yang & Tianyi Fan & Jiajing Gao & Lu Zhen & Junyan Lyu, 2024. "Branch and price algorithm for route optimization on customized bus service," Annals of Operations Research, Springer, vol. 335(1), pages 205-236, April.
    • Handle: RePEc:spr:annopr:v:335:y:2024:i:1:d:10.1007_s10479-023-05474-4
    DOI: 10.1007/s10479-023-05474-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05474-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05474-4?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.

    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:spr:annopr:v:335:y:2024:i:1:d:10.1007_s10479-023-05474-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.