Theory and Practice in Large Carpooling Problems

Abstract We address the carpooling problem as a graph-theoretic problem. If the set of drivers is known in advance, then for any car capacity, the problem is equivalent to the assignment problem in bipartite graphs. Otherwise, when we do not know in advance who will drive their vehicle and who will be a passenger, the problem is NP-hard. We devise and implement quick heuristics for both cases, based on graph algorithms, as well as parallel algorithms based on geometric/algebraic approach. We compare between the algorithms on random graphs, as well as on real, very large, data.

[1]  Davy Janssens,et al.  Estimating Scalability Issues While Finding an Optimal Assignment for Carpooling , 2013, ANT/SEIT.

[2]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[3]  H. W. Kuhn B R Y N Mawr College.  Variants of the Hungarian Method for Assignment Problems' , 1955 .

[4]  Yunmei Chen,et al.  Projection Onto A Simplex , 2011, 1101.6081.

[5]  Davy Janssens,et al.  Exploiting graph-theoretic tools for matching in carpooling applications , 2013, Journal of Ambient Intelligence and Humanized Computing.

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  Geraldo Galdino de Paula,et al.  A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .

[8]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[9]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[11]  Alessandro Persona,et al.  THE CAR POOLING PROBLEM: HEURISTIC ALGORITHMS BASED ON SAVINGS FUNCTIONS , 2003 .

[12]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).