Results 1  10
of
103,274
A Genetic Algorithm with Exon Shuffling Crossover for Hard Bin Packing Problems
, 2007
"... A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steadystate 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 steadystate 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
, 2007
"... A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steadystate 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 steadystate 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
FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in LookupTable Based FPGA Designs
 IEEE TRANS. CAD
, 1994
"... The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Bo ..."
Abstract

Cited by 317 (41 self)
 Add to MetaCart
Boolean networks and little is known about how far their solutions are away from the optimal ones. This paper presents a theoretical breakthrough which shows that the LUTbased FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time. A key step in our algorithm
A Genetic Algorithm Approach to Compaction, Bin Packing, and Nesting Problems
, 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
RGFGA: An Efficient Representation and Crossover for Grouping Genetic Algorithms
"... There is substantial research into genetic algorithms that are used to group large numbers of objects into mutually exclusive subsets based upon some fitness function. However, nearly all methods involve degeneracy to some degree. We introduce a new representation for grouping genetic algorithms, th ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
, the restricted growth function genetic algorithm, that effectively removes all degeneracy, resulting in a more efficient search. A new crossover operator is also described that exploits a measure of similarity between chromosomes in a population. Using several synthetic datasets, we compare the performance
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important
Dimensional Rectangular Single Bin Size Bin Packing
"... Problem (2DRBPP) was studied in this study. The objective of this problem was to pack a given set of small rectangles, which may be rotated by 90°, without overlaps into a minimum numbers of identical large rectangles. Our aim was to improve the performance of the MultiCrossover Genetic Algorithm (M ..."
Abstract
 Add to MetaCart
Problem (2DRBPP) was studied in this study. The objective of this problem was to pack a given set of small rectangles, which may be rotated by 90°, without overlaps into a minimum numbers of identical large rectangles. Our aim was to improve the performance of the MultiCrossover Genetic Algorithm
Local Search For The Bin Packing Problem
, 1999
"... . The bin packing problem consists in finding the minimum number of bins of given capacity which are necessary to pack a certain number of itens. In this work, we propose an improvement procedure for the bin packing problem, based on the progressive reduction of the number of bins used by a previous ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. The bin packing problem consists in finding the minimum number of bins of given capacity which are necessary to pack a certain number of itens. In this work, we propose an improvement procedure for the bin packing problem, based on the progressive reduction of the number of bins used by a
The Grouping Genetic Algorithm (GGA) Applied to the Bin Balancing Problem
, 1995
"... Emanuel Falkenauer published several papers on the Grouping Genetic Algorithm (GGA) [Falkenauer 92], [Falkenauer 94]. The GGA is a new representation proposed by Falkenauer as better suited for grouping problems than the classical representations and operators usually applied to grouping or reorderi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Emanuel Falkenauer published several papers on the Grouping Genetic Algorithm (GGA) [Falkenauer 92], [Falkenauer 94]. The GGA is a new representation proposed by Falkenauer as better suited for grouping problems than the classical representations and operators usually applied to grouping
Results 1  10
of
103,274