A destroy and repair algorithm for the Bike sharing Rebalancing Problem-Reference-Cited by-同舟云学术

A destroy and repair algorithm for the Bike sharing Rebalancing Problem

Published:2016-07 Issue: Volume:71 Page:149-162
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Dell׳Amico Mauro,Iori Manuel,Novellani Stefano^ORCID,Stützle Thomas

Funder

CAPES/Brazil

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference38 articles.

1. Bike sharing;DeMaio;J Public Transp,2009

2. DeMaio P, Meddin R. Bike-sharing world map. [Online]. Available: 〈http://bike-sharing.blogspot.it/〉; 2014.

3. The bike sharing rebalancing problem;Dell׳Amico;Omega,2014

4. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery;Hernández-Pérez;Discret Appl Math,2004

5. Shi X, Zhao F, Gong Y. Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem. In: IEEE international conference on intelligent computing and intelligent systems, vol. 1, 2009. p. 175–9.

Cited by 121 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The one-station bike repositioning problem;Discrete Applied Mathematics;2024-11

2. Bike rebalancing: How to find a balanced matching in the k center problem?;European Journal of Operational Research;2024-08

3. Availability simulation and transfer prediction for bike sharing systems based on discrete event simulation;Socio-Economic Planning Sciences;2024-08

4. Dynamic repositioning in bike-sharing systems with uncertain demand: An improved rolling horizon framework;Omega;2024-07

5. Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem;Transportation Science;2024-07