Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/18430
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKNAPEN, Luk-
dc.contributor.authorHartman, Irith Ben-Arroyo-
dc.contributor.authorKeren, Daniel-
dc.contributor.authorYASAR, Ansar-
dc.contributor.authorCHO, Sungjin-
dc.contributor.authorBELLEMANS, Tom-
dc.contributor.authorJANSSENS, Davy-
dc.contributor.authorWETS, Geert-
dc.date.accessioned2015-03-25T11:52:19Z-
dc.date.available2015-03-25T11:52:19Z-
dc.date.issued2015-
dc.identifier.citationJOURNAL OF COMPUTER AND SYSTEM SCIENCES, 81 (3), p. 568-584-
dc.identifier.issn0022-0000-
dc.identifier.urihttp://hdl.handle.net/1942/18430-
dc.description.abstractCarpooling for commuting can save cost and helps in reducing pollution. An automatic Web based Global CarPooling Matching Service (GCPMS) for matching commuting trips has been designed. The service supports carpooling candidates by supplying advice during their exploration for potential partners. Such services collect data about the candidates, and base their advice for each pair of trips to be combined, on an estimate of the probability for successful negotiation between the candidates to carpool. 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 problem of maximizing the expected value of carpooling negotiation success was formulated and was proved to be NP-hard. In addition, the network characteristics for a realistic case have been analyzed. The carpooling network was established using results predicted by the operational FEATHERS activity based model for Flanders (Belgium).-
dc.description.sponsorshipThe research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement nr. 270833.-
dc.language.isoen-
dc.rights© 2014 Elsevier Inc. All rights reserved.-
dc.subject.othergraph theory; star forest; star partition; agent-based modeling; scalability; dynamic networks; learning; activity-based model-
dc.titleScalability issues in optimal assignment for carpooling-
dc.typeJournal Contribution-
dc.identifier.epage584-
dc.identifier.issue3-
dc.identifier.spage568-
dc.identifier.volume81-
local.bibliographicCitation.jcatA1-
dc.description.notesE-mail Addresses:luk.knapen@uhasselt.be-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.1016/j.jcss.2014.11.010-
dc.identifier.isi000348248100007-
dc.identifier.urlhttp://www.sciencedirect.com/science/article/pii/S0022000014001512-
item.validationecoom 2016-
item.accessRightsRestricted Access-
item.fullcitationKNAPEN, Luk; Hartman, Irith Ben-Arroyo; Keren, Daniel; YASAR, Ansar; CHO, Sungjin; BELLEMANS, Tom; JANSSENS, Davy & WETS, Geert (2015) Scalability issues in optimal assignment for carpooling. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 81 (3), p. 568-584.-
item.fulltextWith Fulltext-
item.contributorKNAPEN, Luk-
item.contributorHartman, Irith Ben-Arroyo-
item.contributorKeren, Daniel-
item.contributorYASAR, Ansar-
item.contributorCHO, Sungjin-
item.contributorBELLEMANS, Tom-
item.contributorJANSSENS, Davy-
item.contributorWETS, Geert-
crisitem.journal.issn0022-0000-
crisitem.journal.eissn1090-2724-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
janssensjour.pdf
  Restricted Access		1.09 MBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


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