建立了关于时间(路程)的瓶颈运输问题的动态规划模型,并利用熵作为工具,解决了物品运输过程中所用时间长短的界问题,进而给出易于处理的瓶颈运输问题的动态规划模型。
A new dynamic programming model is presented on the time(distance) for bottleneck transportation problem in this paper, and the critical bound which be induced by entropy can be calculated.
建立了关于时间(路程)的瓶颈运输问题的动态规划模型,并利用熵作为工具,解决了物品运输过程中所用时间长短的界问题,进而给出易于处理的瓶颈运输问题的动态规划模型。
A new dynamic programming model is presented on the time(distance) for bottleneck transportation problem in this paper, and the critical bound which be induced by entropy can be calculated.
应用推荐