1. Application of Prime Numbers to Solve Complex Instances of the Bin Packing Problem.
- Author
-
De la Rosa, Rafael, Castillo, Hilda, Zavala, José C., Martínez, Alicia, and Estrada, Hugo
- Subjects
- *
PRIME numbers , *PROBLEM solving , *BIN packing problem , *HEURISTIC algorithms , *MATHEMATICAL models - Abstract
The problem of Bin Packing is a problem that is still open. Different strategies have been proposed using heuristic algorithms and metaheuristics to solve it without any of them can get the optimal solutions for all instances of hard28 set. This paper presents a heuristic strategy that solves instances of the hard28 set in less time than that obtained by the best algorithm. This heuristic strategy uses two types of patterns that contain instances of the hard28; approximately one sixth of the values of the objects are prime numbers, and also, about a third of their values are greater than half the capacity of the container, these features allows to fill containers before applying First Fit Decreasing heuristic. The presented heuristic significantly reduces the time needed to obtain the optimal value of some instances. The 28 instances of the hard28 set are used to evaluate the heuristic and the optimal values were obtained five them. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF