从目标函数的角度考虑,运输问题包括单目标运输问题(TP)和多目标运输问题(MOTP),其中表上作业法或单纯形法可用来求解 TP,然而,目前对于 MOTP 的求解方法有很多,但没有一个明确的算法,下一章将简单说明已有算法...
基于16个网页-相关网页
带时间约束的运输问题的传统解法通常是用多目标规划法。
The traditional method for solving transportation problem with time restraint is a nonlinear multi-objective (program) method.
后者是一类非线性多目标规划问题，我们把它称为B运输问题。
The later is a nonlinear multiobjective programming, and it is called B Transportation Problem.
构造了多目标多约束水平(MC2)动态运输问题的数学模型，开发了求解这一模型的迭代算法。
In this paper, a dynamic transportation model with multiple criteria and multiple constraint levels (DMC2) is formulated. An algorithm is developed to solve such DMC2 transportation problems.
应用推荐