Resource allocation embedded line balancing problem and ant colony optimization method

This article introduces a resource allocation embedded assembly line balancing problem (RAELBP), whose solution construction involves operations of operator selection/assignment and task sequencing/grouping. The mathematical model of the RAELBP is rigorously defined. In addition, an ant colony optimization (ACO) method, resource allocation first ACO method, is developed for the problem. An artificial ant selects and assigns an operator to each workstation first and then sequentially assigns assembly tasks to each workstation subject to precedence constraints. Alternatives and options relating to the objective function and heuristic value evaluations are provided. A data generator is developed to generate benchmarks for the problem. A software application, RAELBP Solver, implementing the proposed methods is developed for numerical tests. Numerical tests are conducted for different computation modes on three benchmarks of various sizes. Results indicate that the proposed method is capable of solving the problem and achievements in obtaining non-dominated solutions are varied in different modes.