A destroy and repair algorithm for the bike sharing rebalancing problem
From MaRDI portal
Publication:342356
DOI10.1016/j.cor.2016.01.011zbMath1349.90082OpenAlexW2294139373MaRDI QIDQ342356
Manuel Iori, Stefano Novellani, Thomas Stützle, Mauro Dell'Amico
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.011
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Environmental and social implications of incorporating carpooling service on a customized bus system, Coordinating technician allocation and maintenance routing for offshore wind farms, A heuristic algorithm for a single vehicle static bike sharing rebalancing problem, Redistributing stock in library systems with a depot, Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem, A destroy and repair algorithm for the bike sharing rebalancing problem, An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem, The static bike relocation problem with multiple vehicles and visits, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms, Large neighborhood search for the bike request scheduling problem, Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems, Stochastic optimization models for a bike-sharing problem with transshipment, A two-phase heuristic approach to the bike repositioning problem, Scheduling of maintenance work of a large-scale tramway network
Uses Software
Cites Work
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A destroy and repair algorithm for the bike sharing rebalancing problem
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Single-commodity vehicle routing problem with pickup and delivery service
- Inventory rebalancing and vehicle routing in bike sharing systems
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Record breaking optimization results using the ruin and recreate principle
- Bike sharing systems: solving the static rebalancing problem
- Fast neighborhood search for the single machine total weighted tardiness problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Balancing the stations of a self service “bike hire” system
- Note: A local-search heuristic for large set-covering problems
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- Variable neighborhood search: Principles and applications