A multi-day activity-based inventory routing model with space–time–needs constraints

Joseph Ying Jun Chow, Adel E. Nurumbetova

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)243-269
Number of pages27
JournalTransportmetrica A: Transport Science
Volume11
Issue number3
DOIs
StatePublished - Mar 16 2015

Fingerprint

Travel time
travel
Consolidation
Scheduling
need satisfaction
consolidation
scheduling
participation
time
performance
Values

Keywords

  • activity scheduling
  • activity-based travel demand models
  • inventory routing problems
  • Lagrangian relaxation
  • space–time–needs
  • time geography
  • vehicle routing problems

ASJC Scopus subject areas

  • Engineering(all)
  • Transportation

Cite this

A multi-day activity-based inventory routing model with space–time–needs constraints. / Chow, Joseph Ying Jun; Nurumbetova, Adel E.

In: Transportmetrica A: Transport Science, Vol. 11, No. 3, 16.03.2015, p. 243-269.

Research output: Contribution to journalArticle

@article{22e8ff12fa81474b924f2dfc30aa77b5,
title = "A multi-day activity-based inventory routing model with space–time–needs constraints",
abstract = "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.",
keywords = "activity scheduling, activity-based travel demand models, inventory routing problems, Lagrangian relaxation, space–time–needs, time geography, vehicle routing problems",
author = "Chow, {Joseph Ying Jun} and Nurumbetova, {Adel E.}",
year = "2015",
month = "3",
day = "16",
doi = "10.1080/23249935.2014.958120",
language = "English (US)",
volume = "11",
pages = "243--269",
journal = "Transportmetrica A: Transport Science",
issn = "2324-9935",
publisher = "Taylor and Francis",
number = "3",

}

TY - JOUR

T1 - A multi-day activity-based inventory routing model with space–time–needs constraints

AU - Chow, Joseph Ying Jun

AU - Nurumbetova, Adel E.

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 - activity scheduling

KW - activity-based travel demand models

KW - inventory routing problems

KW - Lagrangian relaxation

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

VL - 11

SP - 243

EP - 269

JO - Transportmetrica A: Transport Science

JF - Transportmetrica A: Transport Science

SN - 2324-9935

IS - 3

ER -