运筹学,分支限界法 组合优化问题

问题描述:

运筹学,分支限界法 组合优化问题
a manufacturer of printed circuit boards uses programmable drill machines to drill six holes in each board.The X and Y coordinates of each hole are given in Table-79.The time (in seconds) it takes the drill machine to move from one hole to the next is equal to the distance between the points.What drilling order minimizes the total time that the drill machine spends moving between holes?
我翻译了一下:
一个印刷电路板制造商使用钻床机器在每个电路板上钻6个孔。每个孔的坐标如下表所示。求怎样的钻孔顺序使钻床花费移动在孔之间的总时间减到最小?
表:
X Y 孔
1 2 1
3 1 2
5 3 3
7 2 4
8 3 5
1个回答 分类:英语 2014-11-28

问题解答:

我来补答
好复杂啊,不懂,帮不了你.
 
 
展开全文阅读
剩余:2000
上一页:画钩的
下一页:速率