Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/17635
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHartman, I.-
dc.contributor.authorKeren, D.-
dc.contributor.authorAbu Dbai, A.-
dc.contributor.authorCohan, E.-
dc.contributor.authorKNAPEN, Luk-
dc.contributor.authorYASAR, Ansar-
dc.contributor.authorJANSSENS, Davy-
dc.date.accessioned2014-10-14T07:42:40Z-
dc.date.available2014-10-14T07:42:40Z-
dc.date.issued2014-
dc.identifier.citationProcedia Computer Science 32, p. 339-347-
dc.identifier.issn1877-0509-
dc.identifier.urihttp://hdl.handle.net/1942/17635-
dc.description.abstractWe 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.-
dc.language.isoen-
dc.publisherElsevier Science BV-
dc.relation.ispartofseriesProcedia Computer Science-
dc.rights© 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of Elhad.-
dc.subject.othercarpooling; linear programming; maximum weighted matching; star partition problem; gradient projection algorithm; scalability; incremental algorithms-
dc.titleTheory and practice in large carpooling problems-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedate06-08 June 2014-
local.bibliographicCitation.conferencenameThe 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), the 4th International Conference on Sustainable Energy Information Technology (SEIT-2014)-
local.bibliographicCitation.conferenceplaceHasselt, Belgium-
dc.identifier.epage347-
dc.identifier.spage339-
dc.identifier.volume32-
local.bibliographicCitation.jcatC1-
dc.description.notes[Hartman, Irith Ben-Arroyo; Keren, Daniel; Abu Dbai, Abed; Cohen, Elad] Univ Haifa, Dept Comp Sci, IL-3498838 Haifa, Israel. [Hartman, Irith Ben-Arroyo] Univ Haifa, Caesarea Rothschild Inst, IL-3498838 Haifa, Israel. [Knapen, Luk; Yasar, Ansar-Ul-Haque; Janssens, Davy] Hasselt Univ, Transportat Res Inst IMOB, B-3950 Diepenbeek, Belgium.-
local.publisher.placeAmsterdam-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr32-
dc.identifier.doi10.1016/j.procs.2014.05.433-
dc.identifier.isi000361562600041-
dc.identifier.urlhttp://www.sciencedirect.com/science/article/pii/S1877050914006334#-
local.bibliographicCitation.btitleProcedia Computer Science-
item.fulltextWith Fulltext-
item.fullcitationHartman, I.; Keren, D.; Abu Dbai, A.; Cohan, E.; KNAPEN, Luk; YASAR, Ansar & JANSSENS, Davy (2014) Theory and practice in large carpooling problems. In: Procedia Computer Science 32, p. 339-347.-
item.accessRightsOpen Access-
item.validationecoom 2016-
item.contributorHartman, I.-
item.contributorKeren, D.-
item.contributorAbu Dbai, A.-
item.contributorCohan, E.-
item.contributorKNAPEN, Luk-
item.contributorYASAR, Ansar-
item.contributorJANSSENS, Davy-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
knapeteho.pdf215.9 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

15
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

17
checked on May 8, 2024

Page view(s)

60
checked on Sep 7, 2022

Download(s)

106
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.