This paper studies the classical task assignment problem (TAP) in which M unbreakable tasks are assigned to N agents with the objective to minimize the communication and process costs subject to each agent's capacity constraint. Because a large-size TAP involves many binary variables, most, if not all, traditional methods experience the difficulty in solving the problem within a reasonable time period. Recent works present a logarithmic approach to reduce the number of binary variables in problems with mixed-integer variables. This study proposes a new logarithmic method that significantly reduces the numbers of binary variables and inequality constraints in solving task assignment problems. Our numerical experiments demonstrate that the proposed method is superior to other known methods of this kind for solving large-size TAPs.
Optimal reliability design (ORD) problem is challenging and fundamental to the study of system reliability. For a system with u components/stages where each of them can be set in m possible reliability levels, state-of-the-art linear reformulation models of ORD problem require O(um) binary variables, O(mn) continuous variables together with either O(mn) inequality constraints or O(um) equality constraints. Using the special property of prime factorization and adopting the logarithmic expression technique, in this article, we propose a novel linear reformulation model of the ORD problem requiring O(um) binary variables, O(mn n! ) continuous variables, and very few linear constraints. This theoretic reduction in variables and constraints can lead to significant savings in computational efforts. Our numerical experiments further confirm the drastic reduction in computational time for solving ORD problems in large size.
A two-dimensional cutting stock problem (2DCSP) needs to cut a set of given rectangular items from standard-sized rectangular materials with the objective of minimizing the number of materials used. This problem frequently arises in different manufacturing industries such as glass, wood, paper, plastic, etc. However, the current literatures lack a deterministic method for solving the 2DCSP. However, this study proposes a global method to solve the 2DCSP. It aims to reduce the number of binary variables for the proposed model to speed up the solving time and obtain the optimal solution. Our experiments demonstrate that the proposed method is superior to current reference methods for solving the 2DCSP.