A disaggregated integer L-shaped method for the bike sharing rebalancing problem with stochastic demands

No abstract is available for this paper.

• Publication year

  2025

• Venue

  European Journal of Operational Research

• Publication date

  2025-07-01

• Fields of study

  Mathematics, Business, Engineering, Computer Science

• Identifiers
  DOI 10.1016/j.ejor.2025.07.041
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An evaluation of common modeling choices for the vehicle routing problem with stochastic demands

  2024cited by this paper
• A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse

  2024cited by this paper
• A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries

  2023cited by this paper
• Public transport for smart cities: Recent innovations and future challenges

  2022cited by this paper
• A global comparison of bicycle sharing systems

  2021cited by this paper
• A review of bicycle-sharing service planning problems

  2020cited by this paper
• The Vehicle Routing Problem with Stochastic Two-Dimensional Items

  2020cited by this paper
• New Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands

  2020cited by this paper
• The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations

  2019cited by this paper
• Shared mobility systems: an updated survey

  2018cited by this paper
• The Bike sharing Rebalancing Problem with Stochastic Demands

  2018cited by this paper
• Setting Inventory Levels in a Bike Sharing Network

  2017cited by this paper
• Inventory Routing for Bike Sharing Systems

  2016cited by this paper
• Optimizing the level of service quality of a bike-sharing system

  2016cited by this paper
• 50th Anniversary Invited Article - Future Research Directions in Stochastic Vehicle Routing

  2016cited by this paper
• The static bicycle relocation problem with demand intervals

  2014cited by this paper
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands

  2014cited by this paper
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands

  2013cited by this paper
• Bike sharing systems: Solving the static rebalancing problem

  2013cited by this paper
• Bike-sharing: History, Impacts, Models of Provision, and Future

  2009cited by this paper
• An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

  2006cited by this paper
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

  2004cited by this paper
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

  2002cited by this paper
• The integer L-shaped method for stochastic integer programs with complete recourse

  1993cited by this paper
• A Priori Optimization

  1990cited by this paper
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse

  1986cited by this paper

• Service Level Requirements for Real Life–Sized Bicycle Sharing Systems

  2026cites this paper
• On vehicle routing problems with stochastic demands -- Generic integer L-shaped formulations

  2025cites this paper