基于免疫果蝇混合优化算法的多配送中心选址问题研究

Research on Multi-distribution Center Location Problem Based on Immune-Fruit Fly Hybrid Optimization Algorithm

针对具有NP难性质的多配送中心选址问题,利用果蝇优化算法,对免疫算法进行了优化,提出将果蝇优化算法与免疫算法相结合的免疫果蝇混合优化算法。通过与传统免疫算法的matlab仿真结果对比,使用免疫果蝇混合优化算法解决多配送中心选址问题能够快速收敛于全局最优解并优化选址模型,为解决多配送中心选址问题提供了一种新途径。

For the multi-distribution center location problem with NP-hard characteristic nature, the immune algorithm and the fruit fly optimization algorithm are combined into the immune-fruit fly hybrid optimization algorithm. Compared the mat- lab simulation results of traditional immune optimization algorithm and immune- fruit fly hybrid optimization algorithm＇s, multiple distribution center location problem could be converged quickly to the global optimal solution. The immune- fruit fly hybrid optimization algorithm optimizes the location model and offers a new way to solve the multi-distribution center loca- tion problem.