This paper introduces and solves the static bike rebalancing problem with for bidden temporary operations. In this problem, one aims at finding a minimum cost route in which a vehicle performs a series of pickup and delivery operations while satisfying demand and capacity constraints. In addition, a vehicle can visit stations multiple times but cannot use them to temporarily store or provide bikes. Apart from bike rebalancing, the problem also models courier service transportation and repositioning of inventory between retail stores, where temporary operations are frequently disliked because they require additional manual work and service time. We present some theoretical results concerning problem complexity and worst-case analysis, and then propose three exact algorithms based on different mathematical formulations. Extensive computational results on instances involving up to 80 stations show that an exact algorithm based on a minimal extended network produces the best average results.

The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations / Bruck, Bruno; Cruz, Fabio; Iori, Manuel; Subramanian, Anand. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 53:3(2019), pp. 882-896. [10.1287/trsc.2018.0859]

The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations

Manuel Iori;
2019

Abstract

This paper introduces and solves the static bike rebalancing problem with for bidden temporary operations. In this problem, one aims at finding a minimum cost route in which a vehicle performs a series of pickup and delivery operations while satisfying demand and capacity constraints. In addition, a vehicle can visit stations multiple times but cannot use them to temporarily store or provide bikes. Apart from bike rebalancing, the problem also models courier service transportation and repositioning of inventory between retail stores, where temporary operations are frequently disliked because they require additional manual work and service time. We present some theoretical results concerning problem complexity and worst-case analysis, and then propose three exact algorithms based on different mathematical formulations. Extensive computational results on instances involving up to 80 stations show that an exact algorithm based on a minimal extended network produces the best average results.
53
3
882
896
The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations / Bruck, Bruno; Cruz, Fabio; Iori, Manuel; Subramanian, Anand. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 53:3(2019), pp. 882-896. [10.1287/trsc.2018.0859]
Bruck, Bruno; Cruz, Fabio; Iori, Manuel; Subramanian, Anand
File in questo prodotto:
File Dimensione Formato  
main-body.pdf

accesso aperto

Descrizione: Versione pre print
Tipologia: Post-print dell'autore (bozza post referaggio)
Dimensione 381.08 kB
Formato Adobe PDF
381.08 kB Adobe PDF Visualizza/Apri
VQR_trsc.2018.0859.pdf

non disponibili

Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 852.08 kB
Formato Adobe PDF
852.08 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1174541
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 23
social impact