Resumen

CENTENO ROMERO, Manuel  y  VELASQUEZ, Richard. A metaheuristic algorithm of simulated annealing for the 3AP- axial. Saber [online]. 2016, vol.28, n.3, pp.566-573. ISSN 2343-6468.

In this paper, we developed a simulated annealing metaheuristic to solve the 3-dimensional assignment problem axial (3AP-axial). The 3AP-axial is a combinatorial optimization problem belonging to the NP-hard class; that is, there are no exact algorithms that can solve it in a reasonable computating time, in the worst case. For this reason, metaheuristics was used in order to find "good" solutions. The simulated annealing algorithm is a global optimization method very clever to escape local optima, which performs a stochastic search on the solution space. The results improve the quality of the solutions reported by other methods. Furthermore, solutions were obtained to bigger size problems in a computing time of less or equal than one minute.

Palabras clave : Assignment problem; simulated annealing; metaheuristic.

        · resumen en Español     · texto en Español     · Español ( pdf )