HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The complexity of the Unit Stop Number Problem and its implications to other related problems

Abstract : The Stop Number Problem arises in the management of a dial-a-ride system served by a fleet of autonomous electric vehicles. In such a system, clients request for a ride from an origin station to a destination station, and a fleet of capacitated vehicles must satisfy all requests. The goal is to minimize the number of pick-up/drop-off operations. In this paper we focus on a special case of this problem that was recently conjectured to be NP-Hard. In this regard, we show how such special case relates to other problems known in the literature in order to derive some polynomial-time solvable variants. Moreover, we provide a positive answer to the conjecture by showing that the problem is NP-Hard for any fixed capacity greater than or equal to 2, even for the case where the graph of requests is restricted to the class of planar bipartite graphs. Our proof of NP-Hardness also improves the complexity results known in the literature for the related problems identified.
Complete list of metadata

Contributor : Rafael Colares Connect in order to contact the contributor
Submitted on : Monday, January 25, 2021 - 12:00:57 PM
Last modification on : Tuesday, January 4, 2022 - 6:11:35 AM
Long-term archiving on: : Monday, April 26, 2021 - 6:48:48 PM


Files produced by the author(s)


  • HAL Id : hal-03120087, version 1


Rafael Colares, Mourad Baïou, Hervé Kerivin. The complexity of the Unit Stop Number Problem and its implications to other related problems. 2021. ⟨hal-03120087⟩



Record views


Files downloads