最优线性切割的遗传算法 [英] Genetic algorithm for optimal linear cutting

问题描述

我需要实现一种最佳切割线性材料的算法。例如，对于日志。需要看到原木的长度和原木的长度。

例如：

原木长度：100

< td> 5

件的长度	所需的件数
45	10
30	5
10	103
60

结果应显示长度每个日志和残留产生的碎片。



i有这种材料：

一个简单的C＃遗传算法

但我不知道如何将它应用到我的主题中。



有没有人遇到过类似的问题？



对不起我的英文，

谢谢

I need to implement an algorithm for optimal cutting linear materials. For example, for logs. There length of pieces that need to saw logs and the length of the logs.
Example:
Length of logs: 100

Length of piece	Required number of piecesr
45	10
30	5
10	103
5	60

as a result should show the length of pieces resulting from each log and residue.

i have this material:
A Simple C# Genetic Algorithm
But I do not know how to apply it to my topic.

Has anyone encountered a similar problem?

sorry for my english,
thanks

推荐答案

遗传算法分为4个阶段。



1.-创建初始人口。

2.-从该人群中选择父母作为后代。

3.-使用运算符从选定的后代中重现交叉，突变。

4.-从后代中为下一个人群选择最佳人选。

5.-转到1，直到达到停止标准。



这里重要的事实是你如何对人口中的每个人进行编码，这与说出每个解决方案相同。

The Genetic algorithm is divided into 4 phases.

1.- Create initial population.
2.- Select parents from that population to be offspring.
3.- Reproduce from selected offspring using operators of crossover, mutation.
4.- From the offspring select the best individuals for the next population.
5.- Go to 1 until a stopping criteria is reached.

The important fact here is how you are going to encoded each individual in the population, which is the same as saying every solution.

这篇关于最优线性切割的遗传算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！