摘要
这是一个如何安排加工次序的组合优化问题，文章首先建立了一般问题的数学模型，在对其求解过程中采取了分枝眼界法，保证了所得结果的最优性，且具有很高的时效性。其次针对某部门所采取的贪婪算法给以了评价，在评价中以其近似解与最优解的接近程度、得到最优解的概率为标准，利用计算机模拟对其进行评估，发现对于该问题贪婪算法并不能保证解的最优性，但近似程度较好。而后对调整刀具费用为0的情形进行了讨论，首先给出了一个引理，然后给出了一个简明的优化准则：当对各切割平面按其厚费比以不升序排列时，所得次序为最优加工次序。最后利用题中所给数据进行了验证，再次表明了所得结论的正确性。
The paper is abour an optimization problem to find an optimal cutting order. In this paper,first,we eatablish the mathematcal model of general problem,and use Brarch and BOund Method to solve the problem so that the result must be optimal and the time used to solve the problem is very snort. Second,We discusts the greedy algorithm that is used in practice by some people,We take the proformance ratio or greedy algorithm and the probability of getting the optimal solution as two criteria in discussion. By computer simulating,we discover that the greedy algorthin is not an optimal algorithm,bntthe greedy solution is a very close approximation to the optimas solution. Third,we diseuss the situation that the knife adjusting cost is zero. We presenr a lemma,then give a simple optimal rule? the optinal cutting order is the non-increasing order of dj,where,di is the ratio or thicknes and cost. A lasr,we show the optimkl solution to the given dat.
出处
《杭州电子科技大学学报（自然科学版）》
1997年第4期46-55,共10页
Journal of Hangzhou Dianzi University：Natural Sciences
关键词
分枝限界法
贪婪算法
模拟
优化准则
厚费比
Brarch and Bound Method, greedy algorithm, simulate, optimal rule, ratio or thickness and cost
