Gilles Simonin

Optimisation for the ride-sharing problem: a complexity-based approach

The dial-a-ride problem is a classic challenge in transportation and continues to be relevant across a large spectrum of applications, e.g. door-to-door transportation services, patient transportation, etc. Recently a new variant of the dial-a-ride problem, called ride-sharing, has received attention due to emergence of the use of smartphone-based applications that support location-aware transportation services. The general dial-a-ride problem involves complex constraints on a time-dependent network. In ride-sharing riders (resp. drivers) specify transportation requests (resp. offers) between journey origins and destinations. The two sets of participants, namely riders and drivers, have different constraints; the riders have time windows for starting and finishing the journey, while drivers have a starting time window, a destination, and a vehicle capacity. The challenge is to maximise the overall utility of the participants in the system which can be defined in a variety of ways. In this paper we study variations of the ride-sharing problem, under different notions of utility, from a computational complexity perspective, and identify a number of tractable and intractable cases. These results provide a basis for the development of efficient methods and heuristics for solving problems of real-world scale.

Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks

We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O(nlog(n)) polynomial-time algorithm for a specific coupled-tasks scheduling problem.

Finding Robust Solutions to Stable Marriage.

We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

(a,b)

Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks

-supermatch is a stable matching in which if

Requests Management for Smartphone-Based Matching Applications Using a Multi-agent Approach

a

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

pairs break up it is possible to find another stable matching by changing the partners of those

Approximation algorithm for constrained coupled-tasks scheduling problem

a

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor

pairs and at most

Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph

b