Friday, 10:30 - 10:55 h, Room: H 2032


José Valério de Carvalho
SearchCol algorithms for the level bin packing problem

Coauthors: Filipe Alvelos, Elsa Silva


SearchCol, short for "metaheuristic search by column generation'', is an algorithmic framework for approximately solving integer programming / combinatorial optimization problems with a decomposable structure.
Each iteration of a SearchCol algorithm is made of three phases: (i) column generation is used to generate solutions to subproblems, (ii) a metaheuristic is used to search the (integer) solution space, and (iii) additional constraints, forcing or forbidding attributes of the incumbent solution, are included in the restricted master problem of column generation guiding the generation of new subproblem's solutions in the following iteration.
In this talk, we apply SearchCol algorithms to a bin packing problem where it is intended to minimize the number of used rectangular bins to pack a given set of rectangular items. Additionally, the items must be packed in levels. We present computational results for different variants of the SearchCol algorithms and compare them with other solution approaches.


Talk 1 of the invited session Fri.1.H 2032
"Matheuristics" [...]
Cluster 11
"Integer & mixed-integer programming" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. There are also a lot of other privileges for return customers. Men buy Viagra Gold online not to wait till the lucky event happens but to enjoy each sex act because Viagra effect lasts up to 36 hours!