Large neighborhood search for the bike request scheduling problem
From MaRDI portal
Publication:6069919
DOI10.1111/itor.12688OpenAlexW2947591317WikidataQ127760507 ScholiaQ127760507MaRDI QIDQ6069919
Pieter Vansteenwegen, Unnamed Author, Kenneth Sörensen
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12688
variable neighborhood descentlarge neighborhood searchgreedy randomized adaptive search procedurerepositioningcity bike
Related Items (3)
The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems
Cites Work
- Orienteering problem: a survey of recent variants, solution approaches and applications
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A general heuristic for vehicle routing problems
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- Shared mobility systems: an updated survey
- Inventory rebalancing and vehicle routing in bike sharing systems
- Inventory rebalancing through pricing in public bike sharing systems
- Record breaking optimization results using the ruin and recreate principle
- Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
- Bike sharing systems: solving the static rebalancing problem
- The inventory routing problem: the value of integration
- Balancing the stations of a self service “bike hire” system
- The orienteering problem
This page was built for publication: Large neighborhood search for the bike request scheduling problem
