摘要
研究在突发事件背景下的应急物流选址-路径问题。假定每个需求点的应急物资需求量与两点之间车辆运输时间是不确定的,利用机会约束方法建立了在一定应急限制期下,时间最小化和成本最小化的双目标随机规划模型,并设计了遗传算法对模型进行求解。通过算例分析验证了模型和算法的可行性与有效性。
We study the location and routing problem in the emergency logistics system.Assuming the demand of goods and vehicle travel times are random,we build an LRP model with two objectives of minimizing both emergency cost and time in the time window,using chance-constrained programming theory.We propose a genetic algorithm for solving the problem,and use examples to show the feasibility and the effectiveness of the model and algorithm.
出处
《系统管理学报》
CSSCI
北大核心
2015年第6期828-834,共7页
Journal of Systems & Management
基金
国家自然科学基金资助项目(70972020
71372135
71131004)
关键词
应急物流
选址-路径问题
时间窗
遗传算法
机会约束
规划
emergency logistics
location routing problem
time window
genetic algorithm
chance-constrained
programming
