| 渔船编队规划模型 |
| |
| 引用本文： | 钱鸿,贾复.渔船编队规划模型[J].中国造船,1995(1):11-17. |
| |
| 作者姓名： | 钱鸿 贾复 |
| |
| 作者单位： | 大连水产学院(钱鸿，贾复)，上海交通大学(杨槱) |
| |
| 摘 要： | 船舶编队规划通常归属于线性规划，用单纯形法求解，但对渔船，可能因渔场资源的可捕获量与各渔船年捕获量不匹配，而导致无解。本文提出，对这类问题可以先用匈牙利法求解，以得到渔场资源可捕获量多或少于渔船年捕获量的信息。根据此信息可以处理单纯形法的约束方程组中等式和不等式的关系，从而求出使目标函数值为最小的解。
|
| 关 键 词： | 渔船 作业编队配置 规划模型 |
FISHING FLEET PROGRAMMING MODEL |
| |
| QIAN Hong ,JIA Fu, YANG Yu.FISHING FLEET PROGRAMMING MODEL[J].Shipbuilding of China,1995(1):11-17. |
| |
| Authors: | QIAN Hong JIA Fu YANG Yu |
| |
| Institution: | QIAN Hong ;JIA Fu; YANG Yu(Dalian Fisheries College) (Shanghai Jiao Tong University) |
| |
| Abstract: | Fishing fleet programming usually belongs to linear programming and finds solution by Simplex Method, but the solution may not exist due to the fact that the resource allowable catching quantity of fishing grounds does not match with the catching capability of fishing vessels of fishing fleet. This problem can first be solved by Hungarian Method to obtain information whether the resource of fishing grounds is greater or less than the catching capability of fishing vessels. After this, equality and inequality sign of restrained equation group of Simplex Method can be assigned correctly for finding solution. |
| |
| Keywords: | Fishing Vessel Working formation collocation Planning model |
| 本文献已被 CNKI 维普 等数据库收录！ |
