z-logo
open-access-imgOpen Access
A joint model of household time use and task assignment for elderly couples with multiple constraints
Author(s) -
Kangning Zheng,
Enjian Yao,
Yongsheng Zhang
Publication year - 2021
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0247187
Subject(s) - beijing , karush–kuhn–tucker conditions , task (project management) , discrete choice , multinomial logistic regression , time allocation , estimation , econometrics , computer science , economics , china , geography , mathematics , mathematical optimization , machine learning , management , archaeology
Household time-use patterns are expected to reflect each household member’s daily activity participation and duration with intra-household interactions constrained by multiple budgets. Among various activities, the allocated activity derived from undertaking a household task is studied relatively less in the literature. Who will take an allocated activity is a discrete choice problem of household task assignment, and once a household member is assigned with one household task, other members will have more time to do other activities. To better understand household time-use patterns affected by household task assignment, this paper proposed a joint household-level multiple discrete-continuous extreme value-multinomial logit (MDCEV-MNL) model with multiple constraints. The Karush-Kuhn-Tucker (KKT) method combined with the simulation-based maximum likelihood estimation method is proposed to estimate the proposed model. Based on the household activity-travel data from Beijing of China, the proposed model is customized to explore elderly couples’ time-use patterns with intra-household interactions affected by household task assignment. Following the findings, policy implications are suggested to build an age-friendly society.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here