Joint travel problem in space-time multi-state supernetworks

F. Liao (Corresponding author)

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

2 Citaties (Scopus)

Uittreksel

Joint travel problem (JTP) is an extension of the classic shortest path problem and relevant to shared mobility. A pioneering endeavor via supernetwork framework has been put forward to model two-person JTP. However, it was only addressed in the static context and with the assumption of zero waiting disutility, which resulted in no or weak synchronization among the travelers. This paper proposes a space–time multi-state supernetwork framework to address JTP for conducting one joint activity in the time-dependent context. Space–time synchronization and various choice facets related to joint travel are captured systematically. Two-person JTP is first discussed in a uni-modal transport network, and further extended to incorporate multi-modal and multi-person respectively. Stage-wise recursive formulations are proposed to find the optimal joint paths. It is found that JTP is a variant of Steiner tree problem by reduction and the number of meeting/departing points has no impact on the run-time complexity in space–time multi-state supernetworks
TaalEngels
Pagina's1319-1343
TijdschriftTransportation
Volume46
Nummer van het tijdschrift4
Vroegere onlinedatumnov 2017
DOI's
StatusGepubliceerd - 1 aug 2019

Vingerafdruk

Synchronization
travel
human being
transport network
time

Citeer dit

@article{044ec76dc1ea49ca8a52243311b90695,
title = "Joint travel problem in space-time multi-state supernetworks",
abstract = "Joint travel problem (JTP) is an extension of the classic shortest path problem and relevant to shared mobility. A pioneering endeavor via supernetwork framework has been put forward to model two-person JTP. However, it was only addressed in the static context and with the assumption of zero waiting disutility, which resulted in no or weak synchronization among the travelers. This paper proposes a space–time multi-state supernetwork framework to address JTP for conducting one joint activity in the time-dependent context. Space–time synchronization and various choice facets related to joint travel are captured systematically. Two-person JTP is first discussed in a uni-modal transport network, and further extended to incorporate multi-modal and multi-person respectively. Stage-wise recursive formulations are proposed to find the optimal joint paths. It is found that JTP is a variant of Steiner tree problem by reduction and the number of meeting/departing points has no impact on the run-time complexity in space–time multi-state supernetworks",
author = "F. Liao",
year = "2019",
month = "8",
day = "1",
doi = "10.1007/s11116-017-9835-6",
language = "English",
volume = "46",
pages = "1319--1343",
journal = "Transportation",
issn = "0049-4488",
publisher = "Springer",
number = "4",

}

Joint travel problem in space-time multi-state supernetworks. / Liao, F. (Corresponding author).

In: Transportation, Vol. 46, Nr. 4, 01.08.2019, blz. 1319-1343.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

TY - JOUR

T1 - Joint travel problem in space-time multi-state supernetworks

AU - Liao,F.

PY - 2019/8/1

Y1 - 2019/8/1

N2 - Joint travel problem (JTP) is an extension of the classic shortest path problem and relevant to shared mobility. A pioneering endeavor via supernetwork framework has been put forward to model two-person JTP. However, it was only addressed in the static context and with the assumption of zero waiting disutility, which resulted in no or weak synchronization among the travelers. This paper proposes a space–time multi-state supernetwork framework to address JTP for conducting one joint activity in the time-dependent context. Space–time synchronization and various choice facets related to joint travel are captured systematically. Two-person JTP is first discussed in a uni-modal transport network, and further extended to incorporate multi-modal and multi-person respectively. Stage-wise recursive formulations are proposed to find the optimal joint paths. It is found that JTP is a variant of Steiner tree problem by reduction and the number of meeting/departing points has no impact on the run-time complexity in space–time multi-state supernetworks

AB - Joint travel problem (JTP) is an extension of the classic shortest path problem and relevant to shared mobility. A pioneering endeavor via supernetwork framework has been put forward to model two-person JTP. However, it was only addressed in the static context and with the assumption of zero waiting disutility, which resulted in no or weak synchronization among the travelers. This paper proposes a space–time multi-state supernetwork framework to address JTP for conducting one joint activity in the time-dependent context. Space–time synchronization and various choice facets related to joint travel are captured systematically. Two-person JTP is first discussed in a uni-modal transport network, and further extended to incorporate multi-modal and multi-person respectively. Stage-wise recursive formulations are proposed to find the optimal joint paths. It is found that JTP is a variant of Steiner tree problem by reduction and the number of meeting/departing points has no impact on the run-time complexity in space–time multi-state supernetworks

U2 - 10.1007/s11116-017-9835-6

DO - 10.1007/s11116-017-9835-6

M3 - Article

VL - 46

SP - 1319

EP - 1343

JO - Transportation

T2 - Transportation

JF - Transportation

SN - 0049-4488

IS - 4

ER -