Imagen de Portada

Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard

Guardado en:
Publicado en:Algorithms vol. 18, no. 2 (2025), p. 115
Autor principal: Dósa, György
Otros Autores: Éles, András, Goswami, Angshuman Robin, Szalkai, István, Tuza, Zsolt
Publicado:
MDPI AG
Materias:
Machine learning
Approximation
Algorithms
Packing problem
Combinatorial analysis
Logistics
Heuristic
Genetic algorithms
Optimization
Benchmarks
Heuristic methods
Acceso en línea:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen:In this work, the Bin Packing combinatorial optimization problem is studied from the practical side. The focus is on the Falkenauer T benchmark class, which is a collection of 80 problem instances that are considered hard to handle algorithmically. Contrary to this widely accepted view, we show that the instances of this benchmark class can be solved relatively easily, without applying any sophisticated methods like metaheuristics. A new algorithm is proposed, which can operate in two modes: either using backtrack or local search to find optimal packing. In theory, both operating modes are guaranteed to find a solution. Computational results show that all instances of the Falkenauer T benchmark class can be solved in a total of 1.18 s and 2.39 s with the two operating modes alone, or 0.2 s when running in parallel.
ISSN:1999-4893
DOI:10.3390/a18020115
Fuente:Engineering Database