A branch and price algorithm for the SS/TDMA problem with cardinality constraint

In this paper, we consider a square n×n traffic matrix D   and a satellite having l≤nl≤n receiving and transmitting antennas. Transmissions are allowed by interconnecting pairs of receiving–transmitting antennas, through an on-board switch. We also assume that no preemption of the communications is allowed, and that changing the configuration of the switch requires a negligible time. We ask for a set of switch configurations that minimizes the total time occurring for transmitting the entire traffic matrix. In the literature, an exact method has been already proposed for the SS/TDMA optimization problem without cardinality constraint (i.e. for instances having l=n), but only heuristics have been proposed for the general case. In this paper, from a known MILP formulation we derive an extended formulation, and we use a column generation method to obtain its LP-relaxation. We address the derived pricing problem through a polynomial time algorithm based on solvers for the k-cardinality assignment problem. We insert this lower bound method in a two-phase branch and price algorithm in order to obtain the optimal solutions. To compare our new exact method with the one proposed in literature to solve the SS/TDMA optimization problem without cardinality constraint, we extend this older method to consider the cardinality constraint. The final computational experiments, comparing our new method with other already known methods, show the efficiency of our algorithms.Scope and purposeSatellites are the commonly used devices to wirelessly connect two distant earth points. Since satellites are very expansive devices, it is important to schedule the communications requests in an efficient manner. A satellite receives transmissions requests between pairs of earth stations, and these requests can be described by a traffic matrix. One method used in practice to satisfy these requests is called Satellite-Switched Time-Division-Multiple-Access (SS/TDMA) which requires to partition the traffic matrix entries in sets called frames and to transmit the elements of each different frame in a single time slot. Each frame must contain at most one communication involving the same earth station and the number of its nonzero entries must be at most equal to the number of satellite antennas. Since a satellite has to complete the transmission of a frame before starting the transmission of the next one, each frame is associated with a completion time equal to the maximum transmission time of its entries. A crucial decision, to minimize the total satellite used time, is how to partition the given traffic matrix. Our aim is to provide an effective exact algorithm for finding optimal solutions to the SS/TDMA problem and to compare it with other methods already known in the literature.