针对多车场多目标开放式物流配送车辆路径问题的特点,选取车辆数、行驶距离2个主要优化目标,以完成任务成本最少为目标,建立了多车场多目标组合的开放式物流配送车辆路径优化模型。运用改进的线性加权算法将多目标函数转化为单目标优化模型,结合遗传算法全局搜索能力较强和节约算法局部搜索能力较好的优点,提出了遗传节约综合搜索求解算法,并将所建模型及设计算法应用于实例。研究结果表明,本研究所提出的模型与方法能够有效地解决多车场多目标开放式配送车辆寻求最优路径问题,且较一般遗传算法高效,收敛速度更快。
According to the characteristics of the vehicle routing in logistics distribution of multi-depots and multi-objective open problem, by the selection of two main optimization objectives including the number of vehicles and travel distance, the goal is to complete the tasks at a minimum cost, and the vehicle routing optimization model in logistics distribution of multi-depots and multiobjective combination opening was established.Using the improved linear weighted algorithm to transform the multiple objective functions into a single objec- tive optimization model, combined with the advantages of global search ability of genetic al- gorithm and the local search ability of the C-W algorithm, the comprehensive search algo- rithm was proposed based on genetic algorithm.Finally, an illustrative example analysis was given and proved the availability of the model and the design search algorithm.The results show that the model and algorithm proposed can effectively solve the multi-depots and multi-objective open vehicle to the optimal path problem, which is more efficient, faster convergence compared with the general genetic algorithm.