Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms
From MaRDI portal
Publication:6047927
DOI10.1016/j.cor.2023.106368MaRDI QIDQ6047927
Mengying He, Jian Qiao, Peng-fei Sun, Niannian Sun, Ying Fan
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- The static bike relocation problem with multiple vehicles and visits
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Inventory rebalancing and vehicle routing in bike sharing systems
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A two-phase heuristic approach to the bike repositioning problem
- 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
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem
- Balancing the stations of a self service “bike hire” system
- Integer Programming Formulation of Traveling Salesman Problems
This page was built for publication: Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms