The bike sharing rebalancing problem: Mathematical formulations and benchmark instances

M Dell'Amico, E Hadjicostantinou, M Iori, S Novellani - Omega, 2014 - Elsevier
Bike sharing systems offer a mobility service whereby public bicycles, located at different
stations across an urban area, are available for shared use. These systems contribute …

A survey on pickup and delivery problems: Part I: Transportation between customers and depot

SN Parragh, KF Doerner, RF Hartl - Journal für Betriebswirtschaft, 2008 - Springer
This paper is the first part of a comprehensive survey on pickup and delivery problems.
Basically, two problem classes can be distinguished. The first class, discussed in this paper …

Static pickup and delivery problems: a classification scheme and survey

G Berbeglia, JF Cordeau, I Gribkovskaia, G Laporte - Top, 2007 - Springer
Pickup and delivery problems constitute an important class of vehicle routing problems in
which objects or people have to be collected and distributed. This paper introduces a …

The bike sharing rebalancing problem with stochastic demands

M Dell'Amico, M Iori, S Novellani… - … research part B …, 2018 - Elsevier
In this paper we deal with the stochastic version of a problem arising in the context of self-
service bike sharing systems, which aims at determining minimum cost routes for a fleet of …

The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode

Y Li, J Yang - Computers & Industrial Engineering, 2024 - Elsevier
This paper aims to investigate the vehicle routing problem faced by a logistics service
provider that performs the last-mile delivery of large household appliances under the front …

A truck scheduling problem arising in intermodal container transportation

J Nossack, E Pesch - European Journal of Operational Research, 2013 - Elsevier
We address a truck scheduling problem that arises in intermodal container transportation,
where containers need to be transported between customers (shippers or receivers) and …

Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem

F Zhao, S Li, J Sun, D Mei - Computers & Industrial Engineering, 2009 - Elsevier
In this paper, we proposed a genetic algorithm for the one-commodity pickup-and-delivery
traveling salesman problem. In the proposed algorithm, we designed a new tour …

A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

H Hernández-Pérez, I Rodríguez-Martín… - Computers & Operations …, 2009 - Elsevier
We address in this paper the one-commodity pickup-and-delivery traveling salesman
problem, which is characterized by a set of customers, each of them supplying (pickup …

The static bike sharing rebalancing problem with forbidden temporary operations

BP Bruck, F Cruz, M Iori… - Transportation …, 2019 - pubsonline.informs.org
This paper introduces and solves the static bike rebalancing problem with forbidden
temporary operations. In this problem, one aims at finding a minimum cost route in which a …

An unpaired pickup and delivery vehicle routing problem with multi-visit

D Xu, K Li, X Zou, L Liu - Transportation Research Part E: Logistics and …, 2017 - Elsevier
This paper studies an unpaired pickup and delivery vehicle routing problem allowing for
multi-visit. The problem consists of two interacted decisions: the pairing of supply and …