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

The vehicle relocation problem with operation teams in one-way carsharing systems

Author

Listed:
  • Yuwei Lu
  • Kangzhou Wang
  • Biao Yuan

Abstract

The imbalance of available vehicles at different stations is an outstanding challenge in one-way carsharing systems. Dedicated to this issue, the operation teams in one company in Shanghai, China, each of which contains several workers, take operation vehicles to rebalance sharing vehicles among stations. A pertinent optimization problem, called the vehicle relocation problem with operation teams, is encountered in practice to find the relocation pairs of stations and the visiting routes of operation vehicles. In this paper, a mathematical programming model for minimizing the sum of relocation distance of sharing vehicles and travel distance of operation vehicles is constructed. An adaptive large neighbourhood search algorithm with several problem-specific algorithmic components is developed to efficiently solve the problem. Computational results validate the competitive performance of the proposed approach by comparing it with the commercial optimization software and a sequential approach.

Suggested Citation

  • Yuwei Lu & Kangzhou Wang & Biao Yuan, 2022. "The vehicle relocation problem with operation teams in one-way carsharing systems," International Journal of Production Research, Taylor & Francis Journals, vol. 60(12), pages 3829-3843, June.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:12:p:3829-3843
    DOI: 10.1080/00207543.2021.1933238
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1933238
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1933238?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:12:p:3829-3843. 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.