摘要
考虑了一种车辆和仓库都有能力约束、顾客有hard时间窗口限制的多仓库选址和运输优化问题;给出了一个组合的两阶段启发式算法,第一阶段在考虑客户需求点时间窗口的情况下将其分配给合适的仓库备选点,第二阶段再用改进的节约算法对每个仓库及其相应的客户群优化路线;最后通过实例进行了实验计算分析。
This paper considers a multi-depot location-routing problem with hard time windows for the customers, and capacity restrictions for the vehicles and the depots. And we propose a two-phase heuristic algorithm to solve this complex model. In the first phase, we allocate customer nodes to some appropriate depots, considering the time windows; and in the second phase, we optimize the routing problem for every depot and its related customers by improved C-W algorithm. At last, we give an analysis about this algorithm through an example.
出处
《科技导报》
CAS
CSCD
2006年第5期72-75,共4页
Science & Technology Review
关键词
定位-路径问题
时间窗口
启发式算法
location-routing problem
time window
two-phase heuristic algorithm
