A novel rotating orthogonal method for combinatorial optimization

Based on the principle of the orthogonal method for large-scale experiment design, an efficient rotating orthogonal method is developed to search for the near-optimal solution of combinatorial optimization. Since many problems of integer programming can be converted into zero-one integer programming, a novel efficient method for generating the large-scale 0-1 orthogonal table is proposed. The search algorithm does not find the optimal solution in a purely random way, but searches along an orthogonal table, rotating the table in sequence according to the order of extreme differences of variables, i.e., according to the importance of variables. The concept and basic principles, the construction of 0-1 orthogonal tables, and the search algorithm and its effectiveness are examined using examples