IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v90y2016icp263-278.html
   My bibliography  Save this article

A multiple type bike repositioning problem

Author

Listed:
  • Li, Yanfeng
  • Szeto, W.Y.
  • Long, Jiancheng
  • Shui, C.S.

Abstract

This paper investigates a new static bicycle repositioning problem in which multiple types of bikes are considered. Some types of bikes that are in short supply at a station can be substituted by other types, whereas some types of bikes can occupy the spaces of other types in the vehicle during repositioning. These activities provide two new strategies, substitution and occupancy, which are examined in this paper. The problem is formulated as a mixed-integer linear programming problem to minimize the total cost, which consists of the route travel cost, penalties due to unmet demand, and penalties associated with the substitution and occupancy strategies. A combined hybrid genetic algorithm is proposed to solve this problem. This solution algorithm consists of (i) a modified version of a hybrid genetic search with adaptive diversity control to determine routing decisions and (ii) a proposed greedy heuristic to determine the loading and unloading instructions at each visited station and the substitution and occupancy strategies. The results show that the proposed method can provide high-quality solutions with short computing times. Using small examples, this paper also reveals problem properties and repositioning strategies in bike sharing systems with multiple types of bikes.

Suggested Citation

  • Li, Yanfeng & Szeto, W.Y. & Long, Jiancheng & Shui, C.S., 2016. "A multiple type bike repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 263-278.
    • Handle: RePEc:eee:transb:v:90:y:2016:i:c:p:263-278
    DOI: 10.1016/j.trb.2016.05.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516302867
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2016.05.010?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.

    References listed on IDEAS

    as
    1. Thibaut Vidal & Teodor Gabriel Crainic & Michel Gendreau & Nadia Lahrichi & Walter Rei, 2012. "A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems," Operations Research, INFORMS, vol. 60(3), pages 611-624, June.
    2. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    3. Relvas, Susana & Boschetto Magatão, Suelen N. & Barbosa-Póvoa, Ana Paula F.D. & Neves, Flávio, 2013. "Integrated scheduling and inventory management of an oil products distribution system," Omega, Elsevier, vol. 41(6), pages 955-968.
    4. Muyldermans, L. & Pang, G., 2010. "On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm," European Journal of Operational Research, Elsevier, vol. 206(1), pages 93-103, October.
    5. Christiansen, Marielle & Fagerholt, Kjetil & Flatberg, Truls & Haugen, Øyvind & Kloster, Oddvar & Lund, Erik H., 2011. "Maritime inventory routing with multiple products: A case study from the cement industry," European Journal of Operational Research, Elsevier, vol. 208(1), pages 86-94, January.
    6. Ho, Sin C. & Szeto, W.Y., 2014. "Solving a static repositioning problem in bike-sharing systems using iterated tabu search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 180-198.
    7. Erdoğan, Güneş & Laporte, Gilbert & Wolfler Calvo, Roberto, 2014. "The static bicycle relocation problem with demand intervals," European Journal of Operational Research, Elsevier, vol. 238(2), pages 451-457.
    8. Dell'Amico, Mauro & Hadjicostantinou, Eleni & Iori, Manuel & Novellani, Stefano, 2014. "The bike sharing rebalancing problem: Mathematical formulations and benchmark instances," Omega, Elsevier, vol. 45(C), pages 7-19.
    9. Cornillier, Fabien & Boctor, Fayez & Renaud, Jacques, 2012. "Heuristics for the multi-depot petrol station replenishment problem with time windows," European Journal of Operational Research, Elsevier, vol. 220(2), pages 361-369.
    10. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.
    11. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    12. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    13. Psaraftis, Harilaos N., 2011. "A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases," European Journal of Operational Research, Elsevier, vol. 215(3), pages 572-580, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    2. Du, Mingyang & Cheng, Lin & Li, Xuefeng & Tang, Fang, 2020. "Static rebalancing optimization with considering the collection of malfunctioning bikes in free-floating bike sharing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    3. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    4. Dell’Amico, Mauro & Iori, Manuel & Novellani, Stefano & Subramanian, Anand, 2018. "The Bike sharing Rebalancing Problem with Stochastic Demands," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 362-380.
    5. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    6. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
    7. Alvarez-Valdes, Ramon & Belenguer, Jose M. & Benavent, Enrique & Bermudez, Jose D. & Muñoz, Facundo & Vercher, Enriqueta & Verdejo, Francisco, 2016. "Optimizing the level of service quality of a bike-sharing system," Omega, Elsevier, vol. 62(C), pages 163-175.
    8. Maggioni, Francesca & Cagnolari, Matteo & Bertazzi, Luca & Wallace, Stein W., 2019. "Stochastic optimization models for a bike-sharing problem with transshipment," European Journal of Operational Research, Elsevier, vol. 276(1), pages 272-283.
    9. Huang, Di & Chen, Xinyuan & Liu, Zhiyuan & Lyu, Cheng & Wang, Shuaian & Chen, Xuewu, 2020. "A static bike repositioning model in a hub-and-spoke network framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    10. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    11. Ho, Sin C. & Szeto, W.Y., 2017. "A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 340-363.
    12. Szeto, W.Y. & Shui, C.S., 2018. "Exact loading and unloading strategies for the static multi-vehicle bike repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 176-211.
    13. Li, Yanfeng & Liu, Yang, 2021. "The static bike rebalancing problem with optimal user incentives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    14. Zhang, Dong & Yu, Chuhang & Desai, Jitamitra & Lau, H.Y.K. & Srivathsan, Sandeep, 2017. "A time-space network flow approach to dynamic repositioning in bicycle sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 188-207.
    15. Xu, Dongyang & Li, Kunpeng & Zou, Xuxia & Liu, Ling, 2017. "An unpaired pickup and delivery vehicle routing problem with multi-visit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 218-247.
    16. Alain Quilliot & Antoine Sarbinowski & Hélène Toussaint, 2021. "Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system," Annals of Operations Research, Springer, vol. 298(1), pages 445-468, March.
    17. Lei, Chao & Ouyang, Yanfeng, 2018. "Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 90-109.
    18. Osorio, Jesus & Lei, Chao & Ouyang, Yanfeng, 2021. "Optimal rebalancing and on-board charging of shared electric scooters," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 197-219.
    19. Lv, Chang & Zhang, Chaoyong & Lian, Kunlei & Ren, Yaping & Meng, Leilei, 2020. "A hybrid algorithm for the static bike-sharing re-positioning problem based on an effective clustering strategy," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 1-21.
    20. Ye Ding & Jiantong Zhang & Jiaqing Sun, 2022. "Branch-and-Price-and-Cut for the Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load," Sustainability, MDPI, vol. 14(17), pages 1-24, August.

    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:transb:v:90:y:2016:i:c:p:263-278. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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/548/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.