A task scheduling method for agent/activity-based models
Author(s) -
Luk Knapen,
Glenn Cich,
Davy Janssens
Publication year - 2018
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2018.04.132
Subject(s) - computer science , schedule , scheduling (production processes) , mathematical optimization , relaxation (psychology) , convergence (economics) , set (abstract data type) , task (project management) , duration (music) , operations research , mathematics , programming language , psychology , social psychology , art , management , literature , economics , economic growth , operating system
Estimation 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom