Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/17635
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hartman, I. | - |
dc.contributor.author | Keren, D. | - |
dc.contributor.author | Abu Dbai, A. | - |
dc.contributor.author | Cohan, E. | - |
dc.contributor.author | KNAPEN, Luk | - |
dc.contributor.author | YASAR, Ansar | - |
dc.contributor.author | JANSSENS, Davy | - |
dc.date.accessioned | 2014-10-14T07:42:40Z | - |
dc.date.available | 2014-10-14T07:42:40Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Shakshuki, Elhadi; Yasar, Ansar (Ed.). The 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), the 4th International Conference on Sustainable Energy Information Technology (SEIT-2014), Elsevier Science BV, p. 339-347 | - |
dc.identifier.issn | 1877-0509 | - |
dc.identifier.uri | http://hdl.handle.net/1942/17635 | - |
dc.description.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. | - |
dc.description.sponsorship | The research leading to these results has received funding from the European Union Seventh Framework Program (FP7/2007-2013) under grant agreement no 270833. | - |
dc.language.iso | en | - |
dc.publisher | Elsevier Science BV | - |
dc.relation.ispartofseries | Procedia Computer Science | - |
dc.rights | 2014 Published by Elsevier B.V. Open access under CC BY-NC-ND license. | - |
dc.subject.other | Carpooling | - |
dc.subject.other | Linear Programming | - |
dc.subject.other | Maximum Weighted Matching | - |
dc.subject.other | Star Partition Problem | - |
dc.subject.other | Gradient Projection Algorithm | - |
dc.subject.other | Scalability | - |
dc.subject.other | Incremental Algorithms | - |
dc.title | Theory and practice in large carpooling problems | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Shakshuki, Elhadi | - |
local.bibliographicCitation.authors | Yasar, Ansar | - |
local.bibliographicCitation.conferencedate | 2014, June 06-08 | - |
local.bibliographicCitation.conferencename | The 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), the 4th International Conference on Sustainable Energy Information Technology (SEIT-2014) | - |
local.bibliographicCitation.conferenceplace | Hasselt, Belgium | - |
dc.identifier.epage | 347 | - |
dc.identifier.spage | 339 | - |
dc.identifier.volume | 32 | - |
local.format.pages | 9 | - |
local.bibliographicCitation.jcat | C1 | - |
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.place | Amsterdam | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 32 | - |
local.type.programme | horizonEurope | - |
dc.identifier.doi | 10.1016/j.procs.2014.05.433 | - |
dc.identifier.isi | 000361562600041 | - |
dc.identifier.url | http://www.sciencedirect.com/science/article/pii/S1877050914006334# | - |
local.bibliographicCitation.btitle | The 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), the 4th International Conference on Sustainable Energy Information Technology (SEIT-2014) | - |
local.uhasselt.international | yes | - |
local.relation.horizonEurope | 270833 | - |
item.validation | ecoom 2016 | - |
item.contributor | Hartman, I. | - |
item.contributor | Keren, D. | - |
item.contributor | Abu Dbai, A. | - |
item.contributor | Cohan, E. | - |
item.contributor | KNAPEN, Luk | - |
item.contributor | YASAR, Ansar | - |
item.contributor | JANSSENS, Davy | - |
item.fullcitation | Hartman, I.; Keren, D.; Abu Dbai, A.; Cohan, E.; KNAPEN, Luk; YASAR, Ansar & JANSSENS, Davy (2014) Theory and practice in large carpooling problems. In: Shakshuki, Elhadi; Yasar, Ansar (Ed.). The 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), the 4th International Conference on Sustainable Energy Information Technology (SEIT-2014), Elsevier Science BV, p. 339-347. | - |
item.fulltext | With Fulltext | - |
item.accessRights | Open Access | - |
crisitem.journal.issn | 1877-0509 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
knapeteho.pdf | Published version | 215.9 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.