Distributed Approach for Solving Time-Dependent Problems in Multimodal Transport Networks

Table 2

Best intra component paths recalculated for graph in Figure 1 if the cost of arc (𝑏,𝑐)₂ of 𝐶₂ increases from two to four. Recalculated paths are shown in bold.

	Comp. 𝐶1	Cost	Comp. 𝐶2	Cost	Comp. 𝐶3	Cost
𝑃^∗𝑔𝑠⋅𝑑	{(𝑠,𝑎)1,(𝑎,𝑏)1,(𝑏,𝑑)1}	4	—	—	{(𝑠,𝑐)3,(𝑐,𝑒)3,(𝑒,𝑑)3}	9
𝑃^∗𝑔𝑠⋅−	{(𝑠,𝑎)1,(𝑎,𝑏)1}	2	—	—	{(𝑠,𝑎)3}	5
	{(𝑠,𝑎)1}	1	—	—	{(𝑠,𝑐)3}	1
𝑃^∗𝑔+⋅−	{(𝑎,𝑏)1}	1	{(𝑏,𝑐)2}	4	—	—
𝑃^∗𝑔+⋅𝑑	{(𝑎,𝑏)1,(𝑏,𝑑)1}	3	{(𝑏,𝑑)2}	4	{(𝑎,𝑒)3,(𝑒,𝑑)3}	9
	{(𝑏,𝑑)1}	2	{(𝑐,𝑑)2}	1	{(𝑐,𝑒)3,(𝑒,𝑑)3}	8