Ampol Karoonsoontawong
Ampol Karoonsoontawong
Verified email at kmutt.ac.th
Title
Cited by
Cited by
Year
Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches
A Karoonsoontawong, ST Waller
Transportation Research Record 1964 (1), 104-117, 2006
772006
Integrated network capacity expansion and traffic signal optimization problem: robust bi-level dynamic formulation
A Karoonsoontawong, ST Waller
Networks and Spatial Economics 10 (4), 525-550, 2010
662010
Robust dynamic continuous network design problem
A Karoonsoontawong, ST Waller
Transportation Research Record 2029 (1), 58-71, 2007
512007
Time‐varying lane‐based capacity reversibility for traffic management
A Karoonsoontawong, DY Lin
Computer‐Aided Civil and Infrastructure Engineering 26 (8), 632-646, 2011
412011
Comparison of system-and user-optimal stochastic dynamic network design models using Monte Carlo bounding techniques
A Karoonsoontawong, ST Waller
Transportation research record 1923 (1), 91-102, 2005
342005
A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
DY Lin, A Karoonsoontawong, ST Waller
Networks and Spatial Economics 11 (1), 101-126, 2011
302011
Path-constrained traffic assignment: Modeling and computing network impacts of stochastic range anxiety
C Xie, TG Wang, X Pu, A Karoonsoontawong
Transportation Research Part B: Methodological 103, 136-157, 2017
202017
Congestion pricing technologies: A comparative evaluation
SV Ukkusuri, A Karoonsoontawong, ST Waller, KM Kockelman
202005
Application of reactive tabu search for combined dynamic user equilibrium and traffic signal optimization problem
A Karoonsoontawong, ST Waller
Transportation research record 2090 (1), 29-41, 2009
192009
Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem
A Karoonsoontawong, DY Lin
Networks and Spatial Economics 15 (4), 1011-1048, 2015
172015
A stochastic dynamic user optimal network design model accounting for demand uncertainty
S Ukkusuri, A Karoonsoontawong, ST Waller
Proceedings of the International Conference of Transportations Systems …, 2004
172004
Robustness approach to the integrated network design problem, signal optimization and dynamic traffic assignment problem
A Karoonsoontawong
The University of Texas at Austin, 2007
152007
Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
A Karoonsoontawong, A Taptana
Networks and Spatial Economics 17 (1), 1-39, 2017
112017
Applying hierarchical logistic models to compare urban and rural roadway modeling of severity of rear-end vehicular crashes
T Champahom, S Jomnonkwao, D Watthanaklang, A Karoonsoontawong, ...
Accident Analysis & Prevention 141, 105537, 2020
102020
Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints
P Punyim, A Karoonsoontawong, A Unnikrishnan, C Xie
Networks and Spatial Economics 18 (1), 51-84, 2018
102018
Inventory routing problem with route duration limits and stochastic inventory capacity constraints: tabu search heuristics
A Karoonsoontawong, A Unnikrishnan
Transportation research record 2378 (1), 43-53, 2013
82013
Analysis of rear-end crash on Thai highway: Decision tree approach
T Champahom, S Jomnonkwao, V Chatpattananan, A Karoonsoontawong, ...
Journal of Advanced Transportation 2019, 2019
72019
Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time
A Karoonsoontawong, O Kobkiattawin, C Xie
Networks and Spatial Economics 19 (2), 331-379, 2019
72019
Efficient Insertion Heuristics for Multitrip Vehicle Routing Problem with Time Windows and Shift Time Limits
A Karoonsoontawong
Transportation Research Record 2477 (1), 27-39, 2015
72015
Application of credit-based congestion pricing in Texas: Operational considerations and impacts
K Kockelman, T Waller, P Gulipalli, S Kalmanje, A Karoonsoontawong, ...
62005
The system can't perform the operation now. Try again later.
Articles 1–20