Theory and practice in large carpooling problems

Irith Ben Arroyo Hartman, Daniel Keren, Abed Abu Dbai, Elad Cohen, Luk Knapen, Ansar Ul Haque Yasar, Davy Janssens

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)339-347
Number of pages9
JournalProcedia Computer Science
Volume32
DOIs
StatePublished - 2014
Event5th International Conference on Ambient Systems, Networks and Technologies, ANT 2014 and 4th International Conference on Sustainable Energy Information Technology, SEIT 2014 - Hasselt, Belgium
Duration: 2 Jun 20145 Jun 2014

Keywords

  • Carpooling
  • Gradient Projection Algorithm
  • Incremental Algorithms
  • Linear Programming
  • Maximum Weighted Matching
  • Scalability
  • Star Partition Problem

All Science Journal Classification (ASJC) codes

  • General Computer Science

Fingerprint

Dive into the research topics of 'Theory and practice in large carpooling problems'. Together they form a unique fingerprint.

Cite this