不确定应急物流LRP双目标优化模型

为了优化应急物资配送系统,提高配送的时效性和经济性,以总时间最短和总成本最小为目标,建立了不确定双目标机会约束优化模型,在这个模型中综合考虑了需求点的限制期要求以及需求点物资需求量的不确定性、两节点运输时间的不确定性、若干车辆容量的有限性和若干候选救援中心容量的有限性,并且假设救援车辆完成自身的任务后停靠在就近已经启用的救援中心;运用遗传算法求解该模型,并且利用惩罚函数的思想以及加权法对目标进行了处理,最后给出数值例子验证该模型和算法的有效性.

Bi-objective programming model for location-routing problem in uncertain emergency system

For improving the efficiency of delivery time and reducing cost for emergency materials distribution after natural disasters, this paper aims to construct a uncertain bi-objective chance-constrained programing model for optimizing total travel time and total cost, where the time restriction of demand center, the candidate rescue centers capacity and the vehicles capacity are limited, and the demand of materials and the travel time between two nodes are uncertain. For saving cost, vehicles are considered to stand at the nearby opened rescue center when it finishes its delivery tasks. In this paper, the programming model is solved by a genetic algorithm and the objective is handled by the idea of penalty function and weighting method. Finally, an numerical example is designed to show that this model and the algorithm are useful and available.