Research Reports

Azwan Nazamuddin · Hiroshima University · Chikaraishi Lab
Archived page. This is the Master's-era research site, kept as a record. Every status below is as it stood in August 2026 and is not maintained. For current work see the reports site, and for the finished thesis see the defense deck. The manuscript itself is not published here.
About this research
A Scalable Computational Framework for Activity-Based Dynamic Discrete Choice Models: Reachability, GPU Acceleration, and Baseline Estimation

Cities face persistent welfare trade-offs in transport policy. Congestion pricing, emissions controls, transit investment for ageing populations, and the integration of autonomous mobility all alter who can travel, when, and at what cost — yet the tools most widely used by planners cannot quantify these effects in welfare terms. The dominant four-step traffic model predicts aggregate vehicle volumes but treats mode and departure time as exogenous inputs, leaving the distributional consequences of policy invisible.

Dynamic Discrete Choice Models (DDCMs) for activity-based travel demand address both the behavioral and the welfare measurement problem within a single unified framework. By modeling each time step of the day as a sequential choice over destination, mode, and activity type, DDCMs generate activity-travel patterns as the outcome of forward-looking utility maximization under time-space constraints. The log-sum of the value function at the start of the day constitutes a welfare-consistent consumer surplus measure — policy prediction and welfare measurement emerge from the same model, without additional assumptions.

The central practical obstacle is computational. Computing the welfare measure exactly requires backward induction over every reachable state; for a city-scale network this runs to the order of 108 theoretical states. Every approximation that reduces this cost modifies the value function and therefore corrupts the welfare measure. This thesis demonstrates that exact computation is tractable: reachability-based state pruning and GPU-accelerated backward induction together reduce the effective state space by more than 99% while preserving the value function exactly.

O1 Develop a scalable computational framework for exact inference in activity-based DDCMs, enabling city-scale backward induction while preserving the welfare-consistent value function.
O2 Demonstrate that city-scale DDCM estimation is tractable: recover behaviorally coherent utility parameters from observed travel diary data and characterise the limits of the estimated model.
Computation: ~69 hours → 105 seconds (~2,400×) · Memory: 6.7 TB → 6.5 GB · 144-zone Higashi-Hiroshima network
Where this stood
Master Thesis
Ch 1 — Introduction
Ch 2 — Literature Review
Ch 3 — Model Specification
Ch 4 — Computational Framework
Ch 5 — Parameter Recovery & Identification
Ch 6 — Numerical Variance Experiments
Ch 7 — HH Empirical
Final Defense — Jul 27, 2026 ✓
Technical
Backward induction (GPU, 1.5M states)
NFXP pipeline + analytical gradient
BHHH standard errors
Parameter recovery — R=30 Monte-Carlo ✓
Numerical experiments (Exact vs SA vs RL) ✓
HH estimation (real data) — converged ✓
Papers & Conferences
ICMC 2025 — accepted
APTE 2026 — presented Jul 7–10 ✓
ICMC 2026 — presented Jul 20–22 ✓
hEART 2026 — accepted; revision in progress as of Aug 2026
JSPS DC-1 — submitted; result pending as of Aug 2026
Research roadmap
Phase A
Computational algorithm

Proving the framework works at city scale. Reachability pruning cuts the state space by 99%; GPU backward induction brings exact computation from days to seconds. Both results written up, accepted, and presented.

ICMC 2025 APTE 2026 (Jul 7–10)
Complete — presented (APTE 2026, ICMC 2025)
→
Phase B
Variance-characterization framework

Triggered by hEART reviews: parameter recovery on synthetic data (done, R=30) and the approximation-error characterisation across three approaches — Exact NFXP, Sampling-of-Alternatives, and RL value estimation — are complete and formed the thesis spine. Higashi-Hiroshima real-data estimation converged, validated, and was presented at ICMC 2026 and the Master Thesis final defense. Only the hEART revision remains open.

hEART 2026 (revision) ICMC 2026 — presented ✓ Master Thesis — defended ✓
Current as of Aug 2026 — hEART revision
Reports
June 2026
23
Meeting
Research Progress (M2, Jun 23, 2026)
Parameter recovery confirmed (R=30, θ_travel bias 13.8%→0.8%, CP 97.5%). Exact/SA/RL approximation-error experiments: SA consistent (variance-only, McFadden); RL inconsistent at finite B (Jensen bias + variance). HH full estimation live on Mac Studio (iter 6, best LL=−177,916).
21
Analysis
Exact vs Sampling-of-Alternatives vs RL — Approximation Error
The variance framework: how much error does each approach introduce, and at what compute budget? SA is consistent (variance only, McFadden); RL is inconsistent at finite budget (bias + variance). Variance/bias panels, per-parameter densities, and the bit-level oracle.
Interactive HTML Exact vs SA vs RL Variance Framework
20
Analysis
Parameter Recovery & Identification — Exact NFXP
Does the estimator recover known parameters? Part I: production-fidelity single-run confirmation (transport-scale ridge broken, 13.8%→0.8% bias). Part II: controlled R=30 Monte-Carlo Dekker table, N-sweep (√N consistency), profile-LL, behavioral validation, BHHH standard errors.
Interactive HTML Recovery Confirmed ✓ R=30 Monte-Carlo
16
Slides
Inside the DDCM Engine — GPU-Accelerated Codebase Walkthrough
End-to-end technical walkthrough of the DDCM codebase: state-space construction, reachability pruning, GPU backward induction, NFXP estimation pipeline, and the analytical gradient.
Interactive Slides Slidev Codebase Walkthrough
01
Investig.
Analytical Gradient Investigation — NFXP Estimation Unblocked
Every NFXP estimation run stalled: the optimizer gave up after a few iterations and one parameter jammed at its bound every time. The cause turned out to be a wrong gradient — 38% off — triggered by an integer overflow on the Apple GPU backend when processing multiple home zones at once. CUDA is confirmed clean. Estimation is unblocked.
Interactive HTML CUDA Clean ✓ Estimation Unblocked ✓
01
Meeting
Research Progress (M2, Jun 1, 2026)
Gradient investigation result (NFXP estimation unblocked); APTE revision plan (3 reviewer points); Thesis Chapter 2 outline review. Includes warm-start parameter table and all supplementary session reports.
April 2026
27
Meeting
Research Progress (M2, Apr 27, 2026)
Gradient bug fixes, c_change identification diagnosis, JSPS proposal updates.
19
Meeting
Master Thesis Progress (M2, April 2026)
Full framework overview presented to the lab: μ(t) utility profiles, computational and behavioral results, estimation diagnosis.
19
Slides
Research Presentation Deck
Interactive presentation of the full research: framework, reachability pruning, μ(t) utility, estimation results. Updated each semester.
Interactive Slides Slidev M2 Spring 2026
January 2026
27
Meeting
Progress on Validation Plan
07
Meeting
RMDP Theory and Implementation
December 2025
24
Meeting
Universal Graph and BI Optimization
15
Meeting
Progress on Documentation, Re-framework the Algorithm
November 2025
26
Meeting
Tensor-Based Summary Update
09
Meeting
SMASO-X Presentation Summary
04
Meeting
Readings and Implementation Plans
October 2025
15
Meeting
Ideas on TD Estimation on DDCM