Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm

• DOI: 10.7717/peerj-cs.1728
• Publication Date: 2023-12-08T08:13:54Z
• Authors: Leonardo Javier M...; Irving Barragan-Vite; Juan Carlos Seck-...; Norberto Hernande...; Manuel González-H...; Joselito Medina-M...
• Keywords: Bin packing problem; Heuristics; Minification; Economic shortage

The one-dimensional cutting-stock problem (1D-CSP) consists of obtaining a set items different lengths from stocks one or lengths, where the minimization waste is main objectives to be achieved. This arises in several industries like wood, glass, and paper, among others similar. Different approaches have been designed deal with this ranging exact algorithms hybrid methods heuristics metaheuristics. African Buffalo Optimization (ABO) algorithm used work address 1D-CSP. has recently introduced solve combinatorial problems such as travel salesman bin packing problems. A procedure was improve search by taking advantage location buffaloes just before it needed restart herd, aim not losing advance reached search. instances literature were test algorithm. results show that developed method competitive against other heuristics, metaheuristics, approaches.