Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/26627
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKNAPEN, Luk-
dc.contributor.authorCICH, Glenn-
dc.contributor.authorJANSSENS, Davy-
dc.date.accessioned2018-08-07T08:49:12Z-
dc.date.available2018-08-07T08:49:12Z-
dc.date.issued2018-
dc.identifier.citationShakshuki, Elhadi; Yasar, Ansar (Ed.). The 9th International Conference on Ambient Systems, Networks and Technologies (ANT 2018) / The 8th International Conference on Sustainable Energy Information Technology (SEIT-2018) / Affiliated Workshops, Elsevier B.V.,p. 761-766-
dc.identifier.issn1877-0509-
dc.identifier.urihttp://hdl.handle.net/1942/26627-
dc.description.abstractEstimation of spatio-temporal travel demand requires accurate activity schedules as an input along with a mechanism to adapt the schedules to changing travel options. Individuals are assumed to own a duty list of activities to be accomplished within the simulated period. A partial order based on chronological and functional constraints determines the set of feasible activity execution sequences (plans). Trip and activity timing is determined by schedule prediction and adaptation. Event times in a schedule are constrained by conditions involving time-of-day (absolute time) and by duration constraints (relative time). Both types of constraints are expressed using time deviation functions (TDF). Each start and end event in a schedule induces a set of non-linear equations expressing the absolute and relative constraints. Time values are determined by solving the set of non-linear equations using a relaxation method. A discrepancy evaluation function is used both as a criterion to decide convergence of the relaxation and to compare alternative schedules for a given plan.-
dc.language.isoen-
dc.publisherElsevier B.V.-
dc.relation.ispartofseriesProcedia Computer Science-
dc.rights(C) 2018 The Authors. Published by Elsevier B.V-
dc.subject.otheragent-based simulation; schedule generation; schedule adaptation; travel demand-
dc.titleA task scheduling method for agent/activity-based models-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsShakshuki, Elhadi-
local.bibliographicCitation.authorsYasar, Ansar-
local.bibliographicCitation.conferencedate8-11/05/2018-
local.bibliographicCitation.conferencenameThe 7th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTrans 2018)-
local.bibliographicCitation.conferenceplacePorto, Portugal-
dc.identifier.epage766-
dc.identifier.spage761-
local.bibliographicCitation.jcatC1-
local.publisher.placeAmsterdam, The Netherlands-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr130-
local.classdsPublValOverrule/author_version_not_expected-
dc.identifier.doi10.1016/j.procs.2018.04.132-
dc.identifier.isi000684379100096-
local.provider.typeWeb of Science-
local.bibliographicCitation.btitleThe 9th International Conference on Ambient Systems, Networks and Technologies (ANT 2018) / The 8th International Conference on Sustainable Energy Information Technology (SEIT-2018) / Affiliated Workshops-
local.uhasselt.internationalno-
item.fullcitationKNAPEN, Luk; CICH, Glenn & JANSSENS, Davy (2018) A task scheduling method for agent/activity-based models. In: Shakshuki, Elhadi; Yasar, Ansar (Ed.). The 9th International Conference on Ambient Systems, Networks and Technologies (ANT 2018) / The 8th International Conference on Sustainable Energy Information Technology (SEIT-2018) / Affiliated Workshops, Elsevier B.V.,p. 761-766.-
item.contributorKNAPEN, Luk-
item.contributorCICH, Glenn-
item.contributorJANSSENS, Davy-
item.validationecoom 2022-
item.validationvabb 2020-
item.accessRightsOpen Access-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Knapen.pdfPublished version321.48 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


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