A heuristic algorithm for a single vehicle static bike sharing rebalancing problem

DOI10.1016/j.cor.2016.09.025zbMath1391.90649arXiv1605.00702OpenAlexW2963578052MaRDI QIDQ1652142

Manuel Iori, Fábio Cruz, Anand Subramanian, Bruno P. Bruck

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00702

zbMATH Keywords

vehicle routingiterated local searchsplit pickup and deliverybike-sharing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (13)

Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system ⋮ Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Large neighborhood search for the bike request scheduling problem ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ 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 ⋮ A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem

Cites Work

• Unnamed Item
• The static bicycle relocation problem with demand intervals
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
• An iterated local search heuristic for the split delivery vehicle routing problem
• Hybrid metaheuristics for the clustered vehicle routing problem
• A destroy and repair algorithm for the bike sharing rebalancing problem
• The case for strategic oscillation
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
• Variable neighborhood search
• Inventory rebalancing and vehicle routing in bike sharing systems
• A simple and effective metaheuristic for the minimum latency problem
• Bike sharing systems: solving the static rebalancing problem
• Balancing the stations of a self service “bike hire” system
• A Tabu Search Heuristic for the Vehicle Routing Problem

This page was built for publication: A heuristic algorithm for a single vehicle static bike sharing rebalancing problem