Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Topological design of ring networks
Computers and Operations Research
Hierarchical self-healing rings
IEEE/ACM Transactions on Networking (TON)
Combinatorial optimization
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
Journal of the ACM (JACM)
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
Topological network design for SONET ring architecture
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Emerging technologies for fiber network survivability
IEEE Communications Magazine
Operations Research Letters
Hi-index | 0.00 |
We define the Balanced Disjoint Rings (BDR) problem as developing a method to partition of the nodes in a network to form a given number of disjoint rings of minimum total link length in such a way that there is almost the same number of nodes in each ring. The BDR problem has potential applications in the design of survivable network structures in telecommunications as well as in the identification of local distribution/collection routes in logistics. The BDR problem can also be considered a generalization of the traveling salesman problem since we are interested in multiple tours instead of a single tour. We develop an efficient heuristic solution methodology that involves various GRASP-based randomized solution construction routines that allow a multi-start framework and a n effective combination of cyclic-exchange and single-move neighborhoods in a local search improvement procedure. The algorithms perform very well in our numerical studies, providing encouraging optimality and lower bound gaps with very reasonable runtimes.