回收物流设施多层选址模型及其算法
Facility LocationM odel for Multi-levelReturned Logistics and ItsAlgorithm
-
摘要: 针对废弃物品的收集、预处理和再制造问题,建立了回收物流设施选址混合整数规划(MILP)模型,用分 枝定界法求解.为提高分枝定界法的收敛速度、减少运算量,先用遗传算法为MILP找到较好的可行解,以其对应 的目标函数值为分枝界定法上界,从而可以在分枝界定法的搜索中剪去大量分枝.用算例证明了算法的有效性 和可行性.Abstract: A facility locationmodel formulti-level returned logisticswas proposed to study the issues of collection, preprocessing and remanufacture of end-of-life products. Thismodel is amixed integer linear program (MILP), and is solved with a branch and bound (B&B) algorithm. To make B&B faster in convergence and less in calculation, a genetic algorithm is used to obtain a reasonably good resolution at the beginning ofB&B. The objective value corresponding to the resolution is taken as the upperbound ofB&B to prune a large number of branches from the searching tree. An example was presented to verify the effectiveness and feasibility of the proposedmethod.
-
Key words:
- returned logistics /
- multi-level location problem /
- branch and bound /
- genetic algorithm /
- MILP /
- model
点击查看大图
计量
- 文章访问数: 1714
- HTML全文浏览量: 66
- PDF下载量: 166
- 被引次数: 0