Dynamic Programming Algorithm of Bottleneck Transportation Problem Based on Entropy

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.In addition,a simplified model that can be solved easily is given.At last,the method illustrated by a given example.