Research Article
Synchronous Routing for Personal Rapid Transit Pods
Algorithm 1
Greedy correction.
(1) integer: , | (2) Procedure RelaxedProb(integer TotalCost, integer PathStructure ) | (3) for () do | (4) if () then | (5) GlobalCost GlobalCost + GreedyCost(PathStructure) | (6) else | (7) GlobalCost GlobalCost + TotalCost | (8) end if | (9) end for | (10) Return (GlobalCost) |
|