Computing minimal solutions to the ring loading problem

Abstract

Given a cycle graph of n nodes and a non-negative demand di,j for each pair of nodes i,j, the ring loading problem with demand splitting (RLPW) asks to determine a routing of these demands such that the maximum load on any edge is minimal. In this work, we present an algorithm for computing minimal solutions to RLPW in O(n2) time. This algorithm, when employed as a subroutine, also improves the runtimes for several other ring loading algorithms by a factor of up to O(n2).