The heterogeneous pickup and delivery problem with configurable vehicle capacity

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

“…To our knowledge, this notion was first introduced by Qu and Bard (2013) who define the heterogeneous PDP with configurable vehicle capacity. The problem could actually be called a DARP since it integrates considerations related to passenger transportation such as ride time minimization.…”

“…In Section 6.2 we present the experiments that determine the choice and calibration of the main components of the proposed matheuristic. The proposed algorithms are compared to state-ofthe-art algorithms on benchmarks from Cordeau and Laporte (2003) and Qu and Bard (2013), which correspond to particular cases of our problem. Finally, we provide managerial insights, mainly regarding vehicle fleet aspects.…”

“…In this paper, we propose a generalization of the heterogeneous PDP with configurable vehicle capacity introduced by Qu and Bard (2013). This problem includes both heterogeneous fleets of vehicles and heterogeneous users.…”

“…Moreover, the total number of passengers can be either 7 or 8, depending on the chosen configuration. Qu and Bard (2013) integrate the choice of the initial vehicle configurations as a decision variable in a PDP dedicated to the transport of people with reduced mobility. In such services, it is actually possible to switch enroute from one configuration to another to serve additional transportation requests.…”

“…In such services, it is actually possible to switch enroute from one configuration to another to serve additional transportation requests. As a result, we propose a generalization to the problem presented by Qu and Bard (2013), by assuming the possibility of en-route reconfiguration. This extension is called the DARP with Re-Configurable vehicle capacity (DARP-RC).…”