activity
20212026
most citedDynamic traffic assignment in a corridor network: Optimum versus Equilibrium

11 citations · 27 across the 8 of their papers we have counts for

collaborators

10 papers

math.OC2026

Flexible and Reliable Network Design for Emerging Transportation Services: Multi-stage Stochastic Programming Approach

Riki Kawase, Koki Satsukawa, Toru Seo

This paper proposes a general framework for flexible and reliable network design problems (FR-NDPs). The framework enables planners to change infrastructure investments in response…

math.OC2025

A bottleneck model with shared autonomous vehicles: Scale economies and price regulations

Koki Satsukawa, Yuki Takayama

This study examines how scale economies in the operation of shared autonomous vehicles (SAVs) affect the efficiency of a transportation system where SAVs coexist with normal vehicl…

math.OC2025

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.OC2024★ 4 cited

Stability analysis of a departure time choice problem with atomic vehicle models

Koki Satsukawa, Kentaro Wada, Takamasa Iryo

In this study, we analyse the global stability of the equilibrium in a departure time choice problem using a game-theoretic approach that deals with atomic users. We first formulat…

math.OC2023

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…

math.OC2023★ 3 cited

Global stability of day-to-day dynamics for schedule-based Markovian transit assignment with boarding queues

Takashi Akamatsu, Koki Satsukawa, Yuki Oyama

Schedule-based transit assignment describes congestion in public transport services by modeling the interactions of passenger behavior in a time-space network built directly on a t…

math.OC2022

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…

math.OC2022★ 1 cited

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…

math.OC2021★ 11 cited

Dynamic traffic assignment in a corridor network: Optimum versus Equilibrium

Haoran Fu, Takashi Akamatsu, Koki Satsukawa +1

This study investigates dynamic system-optimal (DSO) and dynamic user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. The morning comm…

math.OC2021★ 8 cited

Dynamic system optimal traffic assignment with atomic users: Convergence and stability

Koki Satsukawa, Kentaro Wada, David Watling

In this study, we analyse the convergence and stability of dynamic system optimal (DSO) traffic assignment with fixed departure times. We first formulate the DSO traffic assignment…