FiveA is a heuristic algorithm to solve the one-dimensional cut problem. The algorithm consists of 5 methods:
- BP (Build Patterns): used to construct cutting patterns according to the instance.
- GRASP metaheuristic.
- ILS metaheuristic: used how local search of GRASP.
- Rising Method Non Ascending: used how local search of ILS.
- Remove Excess (RE): used to remove excess objects and setups from a solution. It is invoked by the Rising Method Non Ascending method.
FiveA was applied in a set of 1800 instances of the one-dimensional cut problem and managed to achieve competitive results with the literature methods compared. More details can be seen in the publication below.
LANDES, F. B.; SEMAAN, G. S.; PENNA, P. H. V. Um Algoritmo Heuristico Aplicado ao Problema de Corte Unidimensional. SOBRAPO (Ed.), XLIX Simpósio Brasileiro de Pesquisa Operacional – SBPO, p. 2137 – 2148, Blumenau - SC, 2017. Available in: https://www.researchgate.net/publication/322508802_Um_Algoritmo_Heuristico_Aplicado_ao_Problema_de_Corte_Unidimensional
Flávio Barreiro Landes (landesflavio@gmail.com)
Gustavo Silva Semaan
Puca Huachi Vaz Penna