IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i5d10.1007_s10878-020-00635-8.html
   My bibliography  Save this article

Online scheduling of car-sharing request pairs between two locations

Author

Listed:
  • Kelin Luo

    (Eindhoven University of Technology)

  • Yinfeng Xu

    (Xi’an Jiaotong University)

  • Haodong Liu

    (Xi’an Jiaotong University)

Abstract

We consider an online car-sharing problem between two locations with advance bookings. Each customer submits a pair of requests, where each request specifies the pick-up time and the pick-up location: one request from A to B, and the other request from B to A, not necessary in this order. The scheduler aims to maximize the number of satisfied customers, where the schedule has to decide whether or not to accept a request pair immediately at the time when the request pair is submitted. This problem is called OnlineTransfersForCommuting. We present lower bounds on the competitive ratio for this problem with both fixed booking times and variable booking times, and propose two algorithms, greedy algorithm and balanced greedy algorithm, that achieve the best possible competitive ratios.

Suggested Citation

  • Kelin Luo & Yinfeng Xu & Haodong Liu, 2022. "Online scheduling of car-sharing request pairs between two locations," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1240-1263, July.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00635-8
    DOI: 10.1007/s10878-020-00635-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00635-8
    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/s10878-020-00635-8?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:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00635-8. 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.