It is a linear programming problem with minimizing the total operational cost as its object function and taking the restraint of are and node capacities into consideration.
模型以路网总的运营费用最低作为目标函数，同时考虑了线路、车站的能力约束。
Taking minimizing annual operating cost as an object function, the method employed hereditary algorithm to get optimal compensatory places (non-node) and capacity.
该算法以年运行费用最小为目标函数，运用遗传算法求出最佳的补偿地点(非节点)和最优补偿容量。
Taking minimizing annual operating cost as an object function, the method employed hereditary algorithm to get optimal compensatory places (non-node) and capacity.
该算法以年运行费用最小为目标函数，运用遗传算法求出最佳的补偿地点(非节点)和最优补偿容量。
应用推荐