3 papers
math.OC2026
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…
math.OC2026
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…
math.OC2026
Route Based Map Matching via a Structured Codebook and Token Sequence Decoding
Takara Sakai
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…