Chapter 7: Pickup-and-Delivery Problems for People Transportation

Doerner, Karl F.; Salazar-González, Juan-José

doi:10.1137/1.9781611973594.ch7

Cited by 31 publications

(23 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One-to-one problems represent transportation settings in which each service is unique and associated with a fixed origin and destination. A typical application is taxi fleet operations (Doerner and Salazar-González 2014). • M-M. Many-to-many problems involve one or several resources at multiple locations.…”

Section: Specificities Of Customer Requestsmentioning

confidence: 99%

A concise guide to existing and emerging vehicle routing problem variants

Vidal

Laporte

Matl

2020

European Journal of Operational Research

226

View full text Add to dashboard Cite

Section: Specificities Of Customer Requestsmentioning

confidence: 99%

A concise guide to existing and emerging vehicle routing problem variants

Vidal

Laporte

Matl

2020

European Journal of Operational Research

226

View full text Add to dashboard Cite

“…(Chassaing et al, 2016) adapt the Evolutionary Local Search (ELS) and recently (Masmoudi et al, 2017) propose a Hybrid Genetic Algorithm (HGA). For further details, we refer the reader to the recent surveys on pickup and delivery problems for the transportation of goods (Battarra et al, 2014) and of people (Doerner and Salazar Gonzalez, 2014).…”

Section: 2 Dial-a-ride Problemmentioning

confidence: 99%

A dial-a-ride problem using private vehicles and alternative nodes

Brevet

Duhamel

Iori

et al. 2019

J Veh Routing Algorithms

View full text Add to dashboard Cite

This paper addresses the Dial-A-Ride Problem (DARP) using Private Vehicles and Alternative Nodes (DARP-PV-AN). The DARP consists of creating vehicle routes in order to ensure a set of users' transportation requests. Each request corresponds to a client needing to be transported from his/her origin to his/her destination. Routing costs have to be minimized while respecting a set of constraints like time windows and maximum route length. In the classical DARP, vehicles have to start from a depot and come back to it at the end of their route. In the DARP-PV-AN, the on-demand transportation service can be done either by a public fleet or by clients, using their vehicle (private vehicles). The use of these vehicles adds more flexibility and unclog the public transportation fleet by allowing clients to organize their own transportation. However, it also raises some privacy concerns. The DARP-PV-AN addresses these concerns and focuses on location privacy, i.e. the ability to prevent third parties from learning clients' locations, by keeping both original and final location private. This is addressed by setting several pickup/delivery nodes for the transportation requests, thus masking the private address. A compact mixed integer linear model is presented and an Evolutionary Local Search (ELS) is proposed to compute solutions of good quality for the problem. These methods are benchmarked on a modified set of benchmark instances. A new set of realistic instances is also provided to test the ELS in a more realistic way.

show abstract

“…The DARP is related to the optimization of a multi-occupancy, door-todoor transport service for people (Doerner and Salazar-Gonzàlez, 2014). Most commonly, this problem consists in designing the routes of a homogeneous fleet of vehicles to satisfy a set of transportation requests.…”

Section: The Dial-a-ride Problemmentioning

confidence: 99%