Sandra Ulrich Ngueveu

Learn More
This article presents a hybridization of a perfect b-matching within a tabu search framework for the m-Peripatetic Vehicle Routing Problem (m-PVRP). The m-PVRP models for example money transports and cash machines supply where, for security reasons, no path can be used more than once during m periods and the amount of money allowed per vehicle is limited.(More)
Them-Peripatetic Vehicle Routing Problem (m-PVRP) consists in finding a set of routes of minimum total cost over m periods so that two customers are never sequenced consecutively during two different periods. It models for example money transports or cash machines supply, and the aim is to minimize the total cost of the routes chosen. The m-PVRP can be(More)
The computation of the k-shortest paths, should they be elementary or not, has been extensively investigated in the literature, yielding to extremely performant algorithms. For elementary paths, the best known algorithm to this day is the algorithm of Yen enhanced by the extension of Lawler, while for the search of non-elementary paths, the algorithm with(More)
The m-Peripatetic Vehicle Routing Problem (m-PVRP) is defined on a complete undirected graph G = (V,E) where V = {0, ..., n} is the node set (node 0 is the depot and V ′ = V \{0}) and E is the edge set. Each client i ∈ V ′ has a demand di and Q is the capacity of vehicles. A cost ce is assigned to each edge e ∈ E. The objective of the m-PVRP is to identify(More)
multi-agent project scheduling problem Cyril Briand , Sandra Ulrich Ngueveu and Přemysl Š̊ucha (1) CNRS ; LAAS ; 7 avenue du colonel Roche, F-31077 Toulouse Cedex 4, France, (2) Université de Toulouse ; UPS, INP; LAAS; F-31077 Toulouse Cedex 4, France (3) Czech Technical University in Prague; Faculty of Electrical Engineering; Karlovo namesti 13, 121 35,(More)