Synchronous Routing for Personal Rapid Transit Pods

Algorithm 1

Greedy correction.

(1) integer: GlobalCost←0, 𝑖←0

(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)