• 경영과학
• /
• 제18권2호
• /
• pp.107-116
• /
• 2001

In the ring leading problem with demand splitting, traffic demands are given for each pair of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum link load on the ring. Recently, four different optimal a1gorithms have been developed for solving the problem. In this paper, we compare those algorithms in a single framework and conduct a computational study to evaluate the practical performance of those algorithms.