有时间窗物流配送路径优化问题的并购算法

通过对市场资源优化配置中市场行为的了解,提取企业在市场中的行为之一并购行为的精华,并简化并购行为的模型。根据计算得到的企业劣信度,企业间进行合理的并购和重组,也是对市场资源再整合,使资源得到充分的优化配置,进而提高整体企业的市场竞争力。在建立有时间窗物流配送路径优化问题的数学模型基础上,构造有时间窗物流配送路径优化的并购算法模型。该模型包含编码、初始化、预处理、劣信度评估、并购操作、重组操作以及选择操作等七个模块。在Solomon数据集上进行多次实验,并与目前实验已经获得的最优解做比较,获取有时间窗物流配送路径优化问题的最优解或近似最优解。

A Mergers and Acquisitions Algorithm of Optimizing the Physical Distribution Routing Problem with Time Windows

According to studying the market activities of optimizing the market resource distribution,we extract the essence of the Mergers & Acquisitions(M & A) behavior,which is one of the market activities,and simplify the model of the M & A behavior.M & A and restructuring the activities may be operated reasonably among enterprises according to their bad credits,and it is also a re-integration of the market resources,in order to fully optimize,as well as to improve the market competitiveness of all the enterprises.We construct a model of optimizing the physical distribution routing problem with time windows based on the M & A algorithm.The model consists of encoding,initialization,pre-treatment,bad credit assessment,M & A,restructuring and selection in seven modules,on the basis of establishing a mathematic model of optimizing the physical distribution routing problem.After making some experiments on the Solomon data sets and comparing with the optimal solution obtained currently,we obtain the optimal or nearly optimal solutions of optimizing the physical distribution routing problem with time windows.