The Integration of Multimodal Networks: The Generalized Modal Split and Collaborative Optimization of Transportation Hubs
Algorithm 3
Hybrid MSA.
(1)
Initialization: Generate the path set using hybrid K-shortest path method. Set t = 1 and generate a random initial flow vector F (t);
(2)
For all OD pairs, build the mode-choice structure, and .
(3)
while
(4)
Set as a zero vector. Calculate path utility vector C (t) based on F (t).
(5)
For all OD pairs, for k from 0 to K, find the minimum path utility of paths with k transfers from C (t) and denote as . Calculate according to equation (1).
(6)
For all nests in , find the minimum path utility that belongs to nest from C (t) and denote as . Calculate all the according to equation (2).
(7)
For each mode nest , assign all the flow to the path with minimum path cost, and denote the flow vector as .
