The complexity of the Unit Stop Number Problem and its implications to other related problems - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2022

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.
Fichier principal
Vignette du fichier
HAL_The_Complexity_of_the_Stop_Number_Problem_and_its_implications_to_other_related_problems.pdf (408.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03120087 , version 1 (25-01-2021)

Identifiers

Cite

Rafael Colares, Mourad Baïou, Hervé Kerivin. The complexity of the Unit Stop Number Problem and its implications to other related problems. Theoretical Computer Science, 2022, ⟨10.1016/j.tcs.2022.03.027⟩. ⟨hal-03120087⟩
94 View
75 Download

Altmetric

Share

Gmail Facebook X LinkedIn More