Solving the swath segment selection problem through Lagrangean relaxation

The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined by Muraoka [5] and Knight and Smith [3], who respectively proposed a greedy algorithm, named ASTER, and a branch-and-bound algorithm based on a network flow relaxation. Here we tackle the problem with more advanced mathematical programming tools: using a Lagrangean relaxation, coupled with a Lagrangean heuristic and subgradient optimization, we solve in a reasonable computing time instances with up to 20 000 swath segments within 1% of the optimum. The algorithm also proves experimentally superior to commercial MIP solvers, in computing heuristic solutions and equally effective in estimating upper bounds on the optimum.

• Type: Journal
• Year: 2008
• Where: COR
• Authors: Roberto Cordone, Federico Gandellini, Giovanni Righini
• Keywords: Combinatorial Optimization Problem, COR 2008, Swath Segment Selection, Swath Segments