120 search results - page 4 / 24 » Genetically designed heuristics for the bin packing problem |
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
FCT
2007
Springer
15 years 1 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
PPSN
1998
Springer
15 years 1 months ago
1998
Springer
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
IMECS
2007
14 years 11 months ago
2007
— The problem of parts nesting in plane areas is found in several industries, with restrictions and different objectives. Among these industries having this process they are pack...