Results 1 - 10 of 91

A hybrid grouping genetic algorithm for bin packing

by Emanuel Falkenauer - Journal of Heuristics , 1996
"... The Grouping Genetic Algorithm (GGA) is a Genetic Algorithm heavily modified to suit the structure of grouping problems. Those are the problems where the aim is to find a good partition of a set, or to group together the members of the set. The Bin Packing Problem (BPP) is a well known NP-hard group ..."
Abstract - Cited by 110 (1 self) - Add to MetaCart
The Grouping Genetic Algorithm (GGA) is a Genetic Algorithm heavily modified to suit the structure of grouping problems. Those are the problems where the aim is to find a good partition of a set, or to group together the members of the set. The Bin Packing Problem (BPP) is a well known NP

Hybrid Genetic Algorithms for Bin-packing and Related Problems

by Colin Reeves - Annals of Operations Research , 1993
"... The genetic algorithm (GA) paradigm has attracted considerable attention as a promising heuristic approach for solving optimization problems. Much of the development has related to problems of optimizing functions of continuous variables, but recently there have been several applications to problems ..."
Abstract - Cited by 36 (0 self) - Add to MetaCart
good performance for a fairly extensive class of problems by hybridizing the GA with existing simple heuristics. The procedure will be illustrated mainly in relation to the problem of bin-packing , but it could be extended to other problems such as graph-partitioning, parallel-machine scheduling

A Genetic Algorithm for Bin Packing and Line Balancing

by E. Falkenauer, A. Delchambre - PROCEEDINGS OF THE 1992 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION , 1992
"... The bin packing problem can be best described in 'transportation' terms: given a set of boxes of different sizes, how should one pack them all into containers of a given size, in order to use as few containers as possible? The task of balancing of (robotized) assembly lines is of considera ..."
Abstract - Cited by 50 (2 self) - Add to MetaCart
, and (3) as few workstations as possible are needed to perform all the tasks in the set. This paper presents a genetic grouping algorithm for the two problems. We first define the two problems precisely and specify a cost function suitable for the bin packing problem. Next, we show why the classic genetic

Probabilistic Analysis and Parallelization of Bin-Packing Algorithms

by Ee-Chien Chang , 1993
"... Bin-packing problems appear in many applications. Since the general form of binpacking problems is NP-hard, emphasis is placed on the study of heuristic algorithms. To compare the performance of heuristic algorithms, their average-case performance is an appropriate measure when the input of these al ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
for one-dimensional bin-packing. To obtain this optimal parallel algorithm, we develop a randomized version of Brent's Scheduling Principle, which under certain conditions, is able to transform a parallel algorithm to an expected work optimal randomized parallel algorithm.

Three Dimensional Bin Packing Problem with Variable Bin Height

by Yong Wu A, Wenkai Li B, Mark Goh B, Robert De Souza B
"... This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the ..."
Abstract - Add to MetaCart
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep

A Genetic Algorithm Approach to Compaction, Bin Packing, and Nesting Problems

by Erik D. Goodman, Alexander Y. Tetelbaum, Victor M. Kureichik , 1994
"... This technical report is prepared to record the preliminary work carried out in beginning a research project on the solution of a group of related problems by means of Genetic Algorithms (GA's). These problems include integrated circuit layout compaction, bin packing, and nesting. The principal ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
This technical report is prepared to record the preliminary work carried out in beginning a research project on the solution of a group of related problems by means of Genetic Algorithms (GA's). These problems include integrated circuit layout compaction, bin packing, and nesting

A Heuristic for Improved Genetic Bin Packing

by Arthur L. Corcoran, Roger L. Wainwright - INFORMATION PROCESSING LETTERS , 1993
"... The bin packing optimization problem packs a set of objects into a set of bins so that the amount of wasted space is minimized. The bin packing problem has many important applications. These include multiprocessor scheduling, resource allocation, and real-world planning, packing, routing, and sche ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
performance bounds. A survey of approximation algorithms for bin packing and their respective performance bounds are reported by Garey and Johnson [5] in the one dimensional case, Coffman et al. [1] in the two dimensional case, and Li and Cheng [8] in the three dimensional case. In many practical applications

A Genetic Algorithm with Exon Shuffling Crossover for Hard Bin Packing Problems

by Philipp Rohlfshagen, et al. , 2007
"... A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approaches in the literature, without the need for any additional heuristics. The algorithm’s design makes maximum use of the p ..."
Abstract - Add to MetaCart
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approaches in the literature, without the need for any additional heuristics. The algorithm’s design makes maximum use

A Genetic Algorithm with Exon Shuffling Crossover for Hard Bin Packing Problems

by Philipp Rohlfshagen, et al. , 2007
"... A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approaches in the literature, without the need for any additional heuristics. The algorithm’s design makes maximum use of the p ..."
Abstract - Add to MetaCart
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approaches in the literature, without the need for any additional heuristics. The algorithm’s design makes maximum use

Firefly Algorithm to Solve Two Dimensional Bin Packing Problem

by Kratika Chandra, Sudhir Singh , 2014
"... The Firefly algorithm is one of the several nature inspired algorithms that have been developed in the recent past and is inspired from the flashing behaviour of the fireflies. The field of nature inspired computing and optimization techniques have evolved to solve the difficult optimization probl ..."
Abstract - Add to MetaCart
of the fireflies is to attract other fireflies in the group for mating. The less bright firefly will be attracted by the brighter one. As all the fireflies are assumed to be unisexual, each firefly is attracted to the other. In this paper, Firefly Algorithm (FFA) is used to solve Two Dimensional Bin packing
Results 1 - 10 of 91