救护站最优位置选择的算法设计  

Algorithm Design for Optimal Position Selection of Aid Station

作　　者：殷红彩[1] 孙天齐[1] 王勇[1] 

机构地区：[1]安徽财经大学管理科学与工程学院,安徽蚌埠233030

出　　处：《晋中学院学报》2016年第3期1-5,共5页Journal of Jinzhong University

基　　金：安徽财经大学校级一般项目(acjyyb2015039)

摘　　要：针对救护站最优位置选择问题,设计穷举算法,构建了最优位置选择模型,利用MATLAB等软件求解,得到两个救护站的最优位置,并且得到两个救护站到所有街区点的最短距离总和.其后对穷举算法做出了一些改进,使得计算结果更为精确.Aiming at the optimal position selection problem of aid station, the article designs a brute force algorithm to construct the optimal position choice model. Through the use of MATLAB software, two aid stations were fixed in the optimal position, and the sum of the shortest distance between two aid stations and all blocks has been calculated. Then exhaustive calculation has been improved to make the results more accurate.

关 键 词：救护站 穷举算法 最优位置 优化 MATLAB 

分 类 号：O29[理学—应用数学]