Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/15808
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKNAPEN, Luk-
dc.contributor.authorKeren, D.-
dc.contributor.authorYASAR, Ansar-
dc.contributor.authorCHO, Sungjin-
dc.contributor.authorBELLEMANS, Tom-
dc.contributor.authorJANSSENS, Davy-
dc.contributor.authorWETS, Geert-
dc.date.accessioned2013-10-16T08:57:59Z-
dc.date.available2013-10-16T08:57:59Z-
dc.date.issued2013-
dc.identifier.citationProcedia Computer Science 19, p. 372-379-
dc.identifier.issn1877-0509-
dc.identifier.urihttp://hdl.handle.net/1942/15808-
dc.description.abstractAn 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.isoen-
dc.titleEstimating Scalability Issues while Finding an Optimal Assignment for Carpooling-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedate25-28 June 2013-
local.bibliographicCitation.conferencenameANT 2013 The 4th International Conference on Ambient Systems, Networks and Technologies-
local.bibliographicCitation.conferenceplaceHalifax, Nova Scotia, Canada-
dc.identifier.epage379-
dc.identifier.spage372-
local.format.pages8-
local.bibliographicCitation.jcatC1-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr19-
dc.identifier.doi10.1016/j.procs.2013.06.051-
dc.identifier.isi000361480500043-
local.bibliographicCitation.btitleProcedia Computer Science-
item.contributorKNAPEN, Luk-
item.contributorKeren, D.-
item.contributorYASAR, Ansar-
item.contributorCHO, Sungjin-
item.contributorBELLEMANS, Tom-
item.contributorJANSSENS, Davy-
item.contributorWETS, Geert-
item.accessRightsOpen Access-
item.fullcitationKNAPEN, 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.fulltextWith Fulltext-
item.validationecoom 2017-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
knapenker.pdf327.93 kBAdobe PDFView/Open
Show simple item record

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.