1 citations · 1 across the 5 of their papers we have counts for
6 papers
Route Based Map Matching via a Structured Codebook and Token Sequence Decoding
Takara Sakai, Hiroyuki Hasada
This study proposes an efficient and computationally light route based map matching method for GPS track data on urban expressway networks. The key idea is to exploit a symbolic st…
Coarse Preference Reporting in the Bottleneck Model: Approximate Strategyproofness and Efficiency
Takara Sakai, Riki Kawase
A central operator schedules each vehicle's passage time through a bottleneck to achieve a dynamic system optimum (DSO). The assignment depends on each vehicle's preferred arrival…
Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice
Takara Sakai, Takashi Akamatsu, Koki Satsukawa
This study develops a hybrid analytical and numerical approach for dynamic user equilibrium (DUE) assignment with simultaneous route and departure time choice (RDTC) for homogeneou…
A Paradox of Telecommuting and Staggered Work Hours in the Bottleneck Model
Takara Sakai, Takashi Akamatsu, Koki Satsukawa
We study the long- and short-term effects of telecommuting (TLC), staggered work hours (SWH), and their combined scheme on peak-period congestion and location patterns. In order to…
Queue replacement principle for corridor problems with heterogeneous commuters
Takara Sakai, Takashi Akamatsu, Koki Satsukawa
This study investigates the theoretical properties of a departure time choice problem considering commuters' heterogeneity with respect to the value of schedule delay in corridor n…
Non-existence of queues for system optimal departure patterns in tree networks
Takara Sakai, Koki Satsukawa, Takashi Akamatsu
This study proves the non-existence of queues for a dynamic system optimal (DSO) departure pattern in a directed rooted tree network with a single destination. First, considering q…