Solving the two dimensional cutting problem using evolutionary algorithms with penalty functions
In this work a solution using evolutionary algorithms with penalty function for the non-guillotine cutting problem is presented. In this particular problem, the rectangular pieces have to be cut from an unique large object, being the goal to maximize the total value of cut pieces. Some chromosomes c...
Guardado en:
| Autores principales: | Beraudo, Vanina, Orellana, Alina, Alfonso, Hugo, Minetti, Gabriela F., Salto, Carolina |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/22952 |
| Aporte de: |
Ejemplares similares
-
Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002) -
Improving evolutionary algorithms performance by extending incest prevention
por: Alfonso, Hugo, et al.
Publicado: (1998) -
A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
por: Stark, Natalia, et al.
Publicado: (2011) -
An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2002) -
Hybrid evolutionary algorithms for the TSP
por: Minetti, Gabriela F., et al.
Publicado: (2001)