Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/15808
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KNAPEN, Luk | - |
dc.contributor.author | Keren, D. | - |
dc.contributor.author | YASAR, Ansar | - |
dc.contributor.author | CHO, Sungjin | - |
dc.contributor.author | BELLEMANS, Tom | - |
dc.contributor.author | JANSSENS, Davy | - |
dc.contributor.author | WETS, Geert | - |
dc.date.accessioned | 2013-10-16T08:57:59Z | - |
dc.date.available | 2013-10-16T08:57:59Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Procedia Computer Science 19, p. 372-379 | - |
dc.identifier.issn | 1877-0509 | - |
dc.identifier.uri | http://hdl.handle.net/1942/15808 | - |
dc.description.abstract | An automatic service to match commuting trips has been designed. Candidate carpoolers register their personal profile and a set of periodically recurring trips. The Global CarPooling Matching Service (GCPMS) shall advise registered candidates on how to combine their commuting trips by carpooling. Planned periodic trips correspond to nodes in a graph; the edges are labeled with the probability for negotiation success while trying to merge planned trips by carpooling. The probability values are calculated by a learning mechanism using on one hand the registered person and trip characteristics and on the other hand the negotiation feedback. The GCPMS provides advice by maximizing the expected value for negotiation success. This paper describes possible ways to determine the optimal advice and estimates computational scalability using real data for Flanders. | - |
dc.language.iso | en | - |
dc.title | Estimating Scalability Issues while Finding an Optimal Assignment for Carpooling | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | 25-28 June 2013 | - |
local.bibliographicCitation.conferencename | ANT 2013 The 4th International Conference on Ambient Systems, Networks and Technologies | - |
local.bibliographicCitation.conferenceplace | Halifax, Nova Scotia, Canada | - |
dc.identifier.epage | 379 | - |
dc.identifier.spage | 372 | - |
local.format.pages | 8 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 19 | - |
dc.identifier.doi | 10.1016/j.procs.2013.06.051 | - |
dc.identifier.isi | 000361480500043 | - |
local.bibliographicCitation.btitle | Procedia Computer Science | - |
item.contributor | KNAPEN, Luk | - |
item.contributor | Keren, D. | - |
item.contributor | YASAR, Ansar | - |
item.contributor | CHO, Sungjin | - |
item.contributor | BELLEMANS, Tom | - |
item.contributor | JANSSENS, Davy | - |
item.contributor | WETS, Geert | - |
item.accessRights | Open Access | - |
item.fullcitation | KNAPEN, Luk; Keren, D.; YASAR, Ansar; CHO, Sungjin; BELLEMANS, Tom; JANSSENS, Davy & WETS, Geert (2013) Estimating Scalability Issues while Finding an Optimal Assignment for Carpooling. In: Procedia Computer Science 19, p. 372-379. | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2017 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
knapenker.pdf | 327.93 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
13
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
8
checked on Apr 22, 2024
Page view(s)
60
checked on Jul 15, 2022
Download(s)
100
checked on Jul 15, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.