Local Search Algorithms for Reserved Delivery Subnetwork Configuration Problems with Cycle.pdfVIP

Local Search Algorithms for Reserved Delivery Subnetwork Configuration Problems with Cycle and Bicycle Reduction Ruibiao Qiu Jonathan S. Turner ruibiao,jst@arl.wustl.edu Applied Research Laboratory, Department of Computer Science and Engineering Washington University, St. Louis, MO 63130, USA Abstract— A reserved delivery subnetwork (RDS) is a semi- grows more slowly as the average aggregated traffic on a link private network infrastructure to enable an information service increases. provider to deliver more consistent service to its customers. In our In our previous study [1], we showed that the RDS configu- previous study of the RDS configuration problem, we formulated the problem as a minimum concave cost network flow problem ration problem can be formulated as a minimum concave cost (MCCNFP), and presented an efficient approximation algorithm, network flow problem [2], a well-known NP-hard problem. We largest demand first or LDF, to provide approximate solutions proposed an efficient approximation algorithm, largest demand to this NP-hard problem in practice. In this paper, we apply first or LDF, for solving the RDS configuration problem in local search algorithms based on negative cost cycle and bicycle practice. In this paper, we apply local search algorithms based reduction to further improve the quality of the results obtained from LDF. Our simulation results show that the local search on negative cycle and bicycle reduction to improve the quality algorithms improve the quality of LDF solutions, but with added of solutions obtained from LDF. We first apply the cycle computational complexity. They also further