基于时间满意度的应急物资储备库选址问题  

Emergency Material Storages Location Problem Based on Time-Satisfaction

作　　者：刘诚[1] 陈则辉[2] 龚玉燕[1] 

机构地区：[1]中南大学数学与统计学院,湖南长沙410083 [2]南昌工学院经济管理学院,江西南昌330108

出　　处：《数学的实践与认识》2014年第17期8-14,共7页Mathematics in Practice and Theory

基　　金：国家自然科学基金(71071162)

摘　　要：基于应急物资配送过程中时间因素的重要性,将时间满意度引人应急物资储备库选址问题中.针对时间满意度为线性分段函数,建立了以时间满意度最小的需求点的时间满意度尽量大以及系统总费用最小为目标的双目标混合整数规划模型,对目标函数的最小最大值问题进行转化,在此基础上构造新的优化模型,并设计了相应的启发式算法求解.最后通过算例说明算法的可行性和有效性.Owing to the importance of time in the process of emergency material delivery, we take the time-satisfaction into the site location problem. Based on time-satisfactions function is linear piecewise function, a bi-objective mixed-integer programming model which maximizes the least time-satisfaction of every nodes and minimizes the total cost is developed. Then maxmin problem of objective is transformed into a normal maximum objective. Based on that, a new optimum model is constructed and a heuristic algorithm for this model is presented At last, a numerical example is presented to illuminate the algorithm is feasible and effective.

关 键 词：应急物资 时间满意度 混合整数规划 双目标 选址 

分 类 号：O221.4[理学—运筹学与控制论]