Maximum Multicommodity Flow with Intermediate Storage

Algorithm 2

Maximum dynamic multicommodity flow algorithm with intermediate storage (MDMCFAIS).

	Input: given dynamic network .
	Output: maximum dynamic multicommodity flow with intermediate storage in .
(1)	Reconfigure the multicommodity flow problem into independent single commodity flow problems by reallocating the capacity of bundle arcs by using the resource directive decomposition and considering the transit times as cost.
(2)	Construct a modified new network by including temporary sinks, supersource, and supersink in .
(3)	Using new network , construct the time expanded network .
(4)	Calculate the maximum static multicommodity flow with intermediate storage on the time expanded network by using Algorithm 1.
(5)	Transform the solution to the original network by removing the dummy ports, temporary sinks, supersource, supersink, and dummy arcs.