Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleNovember 2016
A random-key genetic algorithm for solving the nesting problem
International Journal of Computer Integrated Manufacturing (IJCIM), Volume 29, Issue 11Pages 1159–1165This article presents a random-key genetic algorithm RKGA for the nesting problem, a particular case of cutting and packing problems in which a collection of items or polygons has to be packed onto a rectangular object with the aim of minimising its ...
- articleNovember 2016
A random-key genetic algorithm for solving the nesting problem
International Journal of Computer Integrated Manufacturing (IJCIM), Volume 29, Issue 11Pages 1159–1165This article presents a random-key genetic algorithm RKGA for the nesting problem, a particular case of cutting and packing problems in which a collection of items or polygons has to be packed onto a rectangular object with the aim of minimising its ...
- articleNovember 2016
A random-key genetic algorithm for solving the nesting problem
International Journal of Computer Integrated Manufacturing (IJCIM), Volume 29, Issue 11Pages 1159–1165This article presents a random-key genetic algorithm RKGA for the nesting problem, a particular case of cutting and packing problems in which a collection of items or polygons has to be packed onto a rectangular object with the aim of minimising its ...
- research-articleJuly 2016
Expanding from Discrete Cartesian to Permutation Gene-pool Optimal Mixing Evolutionary Algorithms
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Pages 637–644https://doi.org/10.1145/2908812.2908917The recently introduced Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) family, which includes the Linkage Tree Genetic Algorithm (LTGA), has been shown to scale excellently on a variety of discrete, Cartesian-space, optimization problems. This ...
- ArticleAugust 2012
A Memetic Algorithm with Random Key Crossover and Modified Neighborhood Search for the Solution of Capacitated Arc Routing Problems
ICGEC '12: Proceedings of the 2012 Sixth International Conference on Genetic and Evolutionary ComputingPages 433–436https://doi.org/10.1109/ICGEC.2012.21Capacitated Arc Routing Problem (CARP) is a well known combinatorial optimization problem and existing algorithms require numerous function evaluations to solve them. in order to develop the capability to solve dynamic CARP problems, there is a need to ...
- ArticleJune 2012
A genetic algorithm for the job shop on an ASRS warehouse
ICCSA'12: Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IIIPages 133–146https://doi.org/10.1007/978-3-642-31137-6_10This paper describes the application of a metaheuristic to a real problem that arises within the domain of loads' dispatch inside an automatic warehouse. The truck load operations on an automated storage and retrieval system warehouse could be modeled ...
- articleNovember 2004
An evolutionary algorithm for manufacturing cell formation
Computers and Industrial Engineering (CINE), Volume 47, Issue 2-3Pages 247–273https://doi.org/10.1016/j.cie.2004.07.003Cellular manufacturing emerged as a production strategy capable of solving the certain problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families ...
- articleJanuary 2003
Evolutionary computation for sensor planning: the task distribution plan
EURASIP Journal on Advances in Signal Processing (JASP), Volume 2003Pages 748–756https://doi.org/10.1155/S1110865703303075Autonomous sensor planning is a problem of interest to scientists in the fields of computer vision, robotics, and photogrammetry. In automated visual tasks, a sensing planner must make complex and critical decisions involving sensor placement and the ...
- articleNovember 2002
A Hybrid Genetic Algorithm for Assembly Line Balancing
Journal of Heuristics (KLU-HEUR), Volume 8, Issue 6Pages 629–642https://doi.org/10.1023/A:1020377910258This paper presents a hybrid genetic algorithm for the simple assembly line problem, SALBP-1. The chromosome representation of the problem is based on random keys. The assignment of the operations to the workstations is based on a heuristic priority ...
- articleMarch 2002
Network random keys: a tree representation scheme for genetic and evolutionary algorithms
Evolutionary Computation (EVOL), Volume 10, Issue 1Pages 75–97https://doi.org/10.1162/106365602317301781When using genetic and evolutionary algorithms for network design, choosing a good representation scheme for the construction of the genotype is important for algorithm performance. One of the most common representation schemes for networks is the ...
- ArticleFebruary 1997
Misplaced Trust: Kerberos 4 Session Keys
One of the commonly accepted principles of software design for security is that making the source code openly available leads to better security. The presumption is that the open publication of source code will lead others to review the code for errors, ...