TY - JOUR
T1 - A multi-day activity-based inventory routing model with space–time–needs constraints
AU - Chow, Joseph Y.J.
AU - Nurumbetova, Adel E.
N1 - Publisher Copyright:
© 2014, © 2014 Hong Kong Society for Transportation Studies Limited.
PY - 2015/3/16
Y1 - 2015/3/16
N2 - We extend activity routing problems to consider ‘needs’ satisfaction over multiple days using an inventory routing problem concept. The resulting inventory-based selective household activity routing problem allows activity type choice, duration choice, activity destination choice, departure time, and scheduling of activities, all within space–time–needs constraints. A Lagrangian relaxation-based algorithm is proposed to solve the model for multiple days. A computational study is conducted. The model can measure several effects: heterogeneity in impacts of travel time changes on different days; the use of dual price as a threshold when needs play a role in the utility maximisation objectives; the possibility for activity participation consolidation due to increased travel time; and non-uniform impacts of travel time increase on utilities across a heterogeneous population. Comparison of the algorithm's performance against a commercial package showed average objective values that differed by only 1.8% or less.
AB - We extend activity routing problems to consider ‘needs’ satisfaction over multiple days using an inventory routing problem concept. The resulting inventory-based selective household activity routing problem allows activity type choice, duration choice, activity destination choice, departure time, and scheduling of activities, all within space–time–needs constraints. A Lagrangian relaxation-based algorithm is proposed to solve the model for multiple days. A computational study is conducted. The model can measure several effects: heterogeneity in impacts of travel time changes on different days; the use of dual price as a threshold when needs play a role in the utility maximisation objectives; the possibility for activity participation consolidation due to increased travel time; and non-uniform impacts of travel time increase on utilities across a heterogeneous population. Comparison of the algorithm's performance against a commercial package showed average objective values that differed by only 1.8% or less.
KW - Lagrangian relaxation
KW - activity scheduling
KW - activity-based travel demand models
KW - inventory routing problems
KW - space–time–needs
KW - time geography
KW - vehicle routing problems
UR - http://www.scopus.com/inward/record.url?scp=84924259649&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84924259649&partnerID=8YFLogxK
U2 - 10.1080/23249935.2014.958120
DO - 10.1080/23249935.2014.958120
M3 - Article
AN - SCOPUS:84924259649
SN - 2324-9935
VL - 11
SP - 243
EP - 269
JO - Transportmetrica A: Transport Science
JF - Transportmetrica A: Transport Science
IS - 3
ER -