灾后带有时间窗的多目标选址-路径问题  

Multi-Objective Location-Routing Problem with Time Windows after Disasters

作　　者：陈贵景 孟献青 王振芳 CHEN Gui-jing;MENG Xian-qing;WANG Zhen-fang(School of Mathematics and Computer Science,Shanxi Datong University,Datong Shanxi,037009)

机构地区：[1]山西大同大学数学与统计学院,山西大同037009

出　　处：《山西大同大学学报（自然科学版）》2018年第5期33-37,共5页Journal of Shanxi Datong University(Natural Science Edition)

摘　　要：灾后救援物资的分布在灾后的救援工作中尤为重要。提出一个带有半时间窗的多目标非线性选址-路径模型,其中受灾点可以被访问多次即需求可分的,目标是最小化运输总成本,最大化受灾点需求物资的满足率和路径的通过能力,路径的通过能力用车辆速度来表示。最后采用遗传算法解决随机产生的若干算例,结果显示该算法解决本文问题稳定有效。The distribution of reliefs after large disaster plays an important role.A nonlinear location-routing problem with halftime windows and with three-objectives is proposed.The disaster sites can be visited more than one time,for the needs are divisible.The target is to minimize the total transportation cost,maximize the rate of satisfying the demand and the ability to pass the path,and the passing capacity of the path is expressed by the vehicle speed.Finally,the genetic algorithm is applied to solve a number of numerical examples,the results show that the genetic algorithm is very stable and effective for this problem.

关 键 词：应急物流 选址-路径问题 多目标优化问题 时间窗 遗传算法 

分 类 号：G505[文化科学—教育学] TS666.242[文化科学—教育技术学]