Abstract
We consider the Ring Loading Problem with integer demand splitting (RLP). The problem is given with a ring network, in which a required traffic requirement between each selected node pair must be routed on it. Each traffic requirement can be routed in both directions of the ring network while splitting each traffic requirement in two directions only by integer is allowed. The problem is to find an optimal routing of each traffic requirement which minimizes the maximum of traffic loads imposed on each link on the network. By characterizing extreme points of the LP relaxation of an IP formulation, we analyze the strength of the LP relaxation. Then we present a strengthened LP which provides enough information to determine the optimal objective value of RLP. Finally, we give an LP-based polynomial-time algorithm for the problem which can handle more general cases where nontrivial upper and lower bounds are imposed on the amount of traffic routed in one direction for some node pairs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Operations Research Society of Japan
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
