In this paper we deal with the stochastic version of a problem arising in the context of self-service bike sharing systems, which aims at determining minimum cost routes for a fleet of homogeneous vehicles in order to redistribute bikes among stations. The Bike sharing Rebalancing Problem with Stochastic Demands is a variant of the one-commodity many-to-many pickup and delivery vehicle routing problem where demands at each station are represented by random variables, with associated probability distributions, that depend on stochastic scenarios. We develop stochastic programming models that are solved using different approaches, in particular, the L-Shaped and branch-and-cut. Moreover, we also propose heuristic algorithms based on an innovative use of positive and negative correlations among stations’ stochastic demands, as well as an efficient strategy for checking feasibility. The proposed solution approaches are evaluated and compared by means of extensive computational experiments on newly realistic benchmark instances.

The Bike sharing Rebalancing Problem with Stochastic Demands / Dell'Amico, Mauro; Iori, Manuel; Novellani, Stefano; Subramanian, Anand. - In: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL. - ISSN 0191-2615. - 118:(2018), pp. 362-380. [10.1016/j.trb.2018.10.015]

The Bike sharing Rebalancing Problem with Stochastic Demands

Dell'Amico, Mauro;Iori, Manuel;Novellani, Stefano
;
2018

Abstract

In this paper we deal with the stochastic version of a problem arising in the context of self-service bike sharing systems, which aims at determining minimum cost routes for a fleet of homogeneous vehicles in order to redistribute bikes among stations. The Bike sharing Rebalancing Problem with Stochastic Demands is a variant of the one-commodity many-to-many pickup and delivery vehicle routing problem where demands at each station are represented by random variables, with associated probability distributions, that depend on stochastic scenarios. We develop stochastic programming models that are solved using different approaches, in particular, the L-Shaped and branch-and-cut. Moreover, we also propose heuristic algorithms based on an innovative use of positive and negative correlations among stations’ stochastic demands, as well as an efficient strategy for checking feasibility. The proposed solution approaches are evaluated and compared by means of extensive computational experiments on newly realistic benchmark instances.
118
362
380
The Bike sharing Rebalancing Problem with Stochastic Demands / Dell'Amico, Mauro; Iori, Manuel; Novellani, Stefano; Subramanian, Anand. - In: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL. - ISSN 0191-2615. - 118:(2018), pp. 362-380. [10.1016/j.trb.2018.10.015]
Dell'Amico, Mauro; Iori, Manuel; Novellani, Stefano; Subramanian, Anand
File in questo prodotto:
File Dimensione Formato  
VQR_1-s2.0-S0191261518301711-main(1).pdf

non disponibili

Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 1.05 MB
Formato Adobe PDF
1.05 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
main.pdf

accesso aperto

Tipologia: Post-print dell'autore (bozza post referaggio)
Dimensione 489.08 kB
Formato Adobe PDF
489.08 kB Adobe PDF Visualizza/Apri
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/1168939
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 58
  • ???jsp.display-item.citation.isi??? 57
social impact