带模糊时间窗的多目标越库选址路径优化问题  

Optimization for Multi-objective Location-routing Problem of Cross-docking with Fuzzy Time Windows

作　　者：刘虹[1] 林楚玥 LIU Hong;LIN Chu-yue(Fuzhou University,Fuzhou 350100 China)

机构地区：[1]福州大学

出　　处：《电子科技大学学报（社科版）》2019年第5期72-78,112,共8页Journal of University of Electronic Science and Technology of China(Social Sciences Edition)

基　　金：福建省自然科学基金项目(2014J05082)

摘　　要：越库配送网络具有高运作效率、低库存等特性,同时对时间要求较高,故研究带时间窗口约束的越库选址路径问题。采用时间窗模糊化处理方法定义客户满意度函数,在能力和载重等约束下,建立越库选址路径问题(CDLRP)的多目标规划模型,通过合理选择越库中心并安排配送路径从而达到降低成本、提高客户满意度和提高配送效率三个目标。针对此多目标问题,设计了嵌套灰关联分析的多目标禁忌搜索算法寻求较好的Pareto最优前沿,最后通过算例仿真验证了优化模型和求解算法的可行和有效性。With the characteristics of high operational efficiency and low inventory level,cross-docking distribution network has higher demand for time.This paper studied the location-routing problem with time window constraints,and the fuzzy processing method was used to define the customer satisfaction function.Under the constraints of capacity and load,a multi-objective integration model was proposed for the location-routing problem.The model aimed to reduce costs,improve customer satisfaction and improve efficiency by selecting the cross-docking centers and arranging the routes reasonably.A multi-objective tabu search algorithm embedded grey relational analysis is designed to find a better Pareto frontier.Finally,the feasibility and effectiveness of the optimization model and the algorithm are verified by simulation.

关 键 词：越库 选址–路径 模糊时间窗 多目标 禁忌搜索算法 

分 类 号：F252[经济管理—国民经济]