This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in a one-dimensional cutting stock problem. The algorithm implemented can generate combinations of ordered lengths of stock (the cutting pattern) and, at the same time, the frequency of the cutting patterns, through a symbiotic process between two distinct populations, solutions and cutting patterns. Working with two objectives in the fitness function and with a symbiotic relationship between the two populations, we obtained positive results when compared with other methods described in the literature
In this paper, we analyze the behavior of symbiotic evolution algorithm for the N-Queens problem as ...
This paper describes an attempt to solve the one-dimensional cutting stock problem heuristically by ...
Cutting and packing problem is one of the most common optimization problem. Even a small space or ma...
This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in ...
This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in ...
This paper investigates the one-dimensional cutting stock problem considering two conflicting object...
This paper investigates the one-dimensional cutting stock problem considering two conflicting object...
This paper deals with the one-dimensional integer cutting stock problem, which consists of cutting a...
The cutting stock problem is that of finding a cutting of stock material to meet demands for small p...
The two-dimensional cutting stock problem is the problem of cutting two-dimensional parts from a sh...
Nesta dissertação, estudamos algoritmos genéticos para resolver o problema de corte unidimensional m...
The Cutting Stock Problem (CSP) is a combinatorial optimisation problem that involves cutting large ...
We introduce an evolutionary stochastic-local-search (SLS) algorithm for addressing a generalized ve...
The one-dimensional cutting stock problem has many applications in industries and during the past fe...
The cutting stock problem (CSP) is a combinatorial optimisation problem that involves cutting large ...
In this paper, we analyze the behavior of symbiotic evolution algorithm for the N-Queens problem as ...
This paper describes an attempt to solve the one-dimensional cutting stock problem heuristically by ...
Cutting and packing problem is one of the most common optimization problem. Even a small space or ma...
This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in ...
This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in ...
This paper investigates the one-dimensional cutting stock problem considering two conflicting object...
This paper investigates the one-dimensional cutting stock problem considering two conflicting object...
This paper deals with the one-dimensional integer cutting stock problem, which consists of cutting a...
The cutting stock problem is that of finding a cutting of stock material to meet demands for small p...
The two-dimensional cutting stock problem is the problem of cutting two-dimensional parts from a sh...
Nesta dissertação, estudamos algoritmos genéticos para resolver o problema de corte unidimensional m...
The Cutting Stock Problem (CSP) is a combinatorial optimisation problem that involves cutting large ...
We introduce an evolutionary stochastic-local-search (SLS) algorithm for addressing a generalized ve...
The one-dimensional cutting stock problem has many applications in industries and during the past fe...
The cutting stock problem (CSP) is a combinatorial optimisation problem that involves cutting large ...
In this paper, we analyze the behavior of symbiotic evolution algorithm for the N-Queens problem as ...
This paper describes an attempt to solve the one-dimensional cutting stock problem heuristically by ...
Cutting and packing problem is one of the most common optimization problem. Even a small space or ma...