A fast 4-approximation algorithm for the traveling repairman problem on a line

Perez, S. L. Perez; Rivero, L. E. Urban; Bracho, Rafael; Martínez, Francisco Javier Zaragoza

doi:10.1109/iceee.2014.6978272

Cited by 3 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second one is a (4 + 𝜀)-approximation algorithm and its complexity time is O (𝑛 8 /𝜀). Perez et al [27] provided a 4-approximation algorithm for OPTW with unitary length time windows on a line whose complexity time is O (𝑛 2 ). Miguel and Pilar [28] proposed an integer linear programming approach for OPTW on a line with unit time windows, which produces approximate solutions within a factor of 4 to the optimal solution.…”

Section: Maximum Prize Problemsmentioning

confidence: 99%

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment

D’Emidio,

Delfaraz,

Di Stefano

et al. 2024

Applied Sciences

View full text Add to dashboard Cite

The introduction of 5G technologies has enabled the possibility of designing and building several new classes of networked information systems that were previously impossible to implement due to limitations on data throughput or the reliability of transmission channels. Among them, one of the most interesting and successful examples with a highly positive impact in terms of the quality of urban environments and societal and economical welfare is a system of semi-autonomous connected vehicles, where IoT devices, data centers, and fleets of smart vehicles equipped with communication and computational resources are combined into a heterogeneous and distributed infrastructure, unifying hardware, networks, and software. In order to efficiently provide various services (e.g., patrolling, pickup and delivery, monitoring), these systems typically rely on collecting and broadcasting large amounts of data (e.g., sensor data, GPS traces, or maps), which need to be properly collected and processed in a timely manner. As is well documented in the literature, one of the most effective ways to achieve this purpose, especially in a real-time context, is to adopt a graph model of the data (e.g., to model communication networks, roads, or interactions between vehicles) and to employ suitable graph algorithms to solve properly defined computational problems of interest (e.g., shortest paths or distributed consensus). While research in this context has been extensive from a theoretical perspective, works that have focused on the implementation, deployment, and evaluation of the practical performance of graph algorithms for real-world systems of autonomous vehicles have been much rarer. In this paper, we present a study of this kind. Specifically, we first describe the main features of a real-world information system employing semi-autonomous connected vehicles that is currently being tested in the city of L’Aquila (Italy). Then, we present an overview of the computational challenges arising in the considered application domain and provide a systematic survey of known algorithmic results for one of the most relevant classes of computational problems that have to be addressed in said domain, namely, pickup and delivery problems. Finally, we discuss implementation issues, adopted software tools, and the deployment and testing phases concerning one of the algorithmic components of the mentioned real-world system dedicated to handling a specific problem of the above class, namely, the pickup and delivery multi-vehicle problem with time windows.

show abstract

Section: Maximum Prize Problemsmentioning

confidence: 99%

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment

D’Emidio,

Delfaraz,

Di Stefano

et al. 2024

Applied Sciences

View full text Add to dashboard Cite

show abstract

An ILP approach for the traveling repairman problem with unit time windows

Miguel-Pilar

Morales‐Luna

Troncoso

et al. 2015

2015 12th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)

View full text Add to dashboard Cite

3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows

Rivero¹,

Villalobos²,

Bracho³

et al. 2015

RCS

View full text Add to dashboard Cite

The travelling repairman problem (TRP) is a scheduling problem in which a repairman must visit locations to perform some task. Each location has a time window in which the repairman is allowed to arrive. The objective of this problem is to maximize the number of tasks performed. In this paper, we consider a special case in which all the locations are on a straight line, the tasks have no processing time, and all time-windows are of unit length. We present an improvement on the analysis of the 4-approximation algorithm presented by S. L. Pérez Pérez et al. in 2014.

show abstract

A fast 4-approximation algorithm for the traveling repairman problem on a line

Cited by 3 publications

References 4 publications

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment

An ILP approach for the traveling repairman problem with unit time windows

3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows

Contact Info

Product

Resources

About