Abstract: The Floyd algorithm is applied to calculate the shortest path and the shortest distance between any two of the 18 major towns in Hainan province. We strive to explore how to make an allocation plan to assign the medical and health supplies from the given center locations reserving these goods and materials to all other towns, such that the total ton-kilometre (ton.km) numbers of the freight transport is minimized and achieve an optimal allocation in engineering. We respectively consider three situations, one center location (town)--Qiongzhong; two center locations (towns)--Ledong and Tunchang; three  center locations (towns)- Changjiang, Dingan and Wuzhishan, and establish the optimization models. The relevant parameters in the models are estimated reasonably, and the numerical results are obtained respectively by Lingo mathematical software in three cases. Furthermore, the optimization models are established similarly in the case of an unknown center point position (not in eighteen towns).

Key words: Floyd algorithm, center locations, medical and health supplies, Ton.km numbers minimum, optimization model