基于PEGA求解TSPD的物流配送路径优化算法

Partheno evolution genetic algorithm solving taveling salesman problem with pickup and delivery

配送-收集旅行商问题是物流中的重要问题,与一般的旅行商问题不同,目前对该问题的研究有限,一般假定必须在完成所有的配送需求后才服务需求,并且所用算法性能较差。运用PEGA利用父体所提供的有效边的信息,使用保留最小边的方法对个体进行进化,求得费用最低的优化路径,得到问题的解。该算法可以快速地求得问题的全局最优解。

Traveling salesman problem with pickup and delivery is an important problem in logistics. However, much less effort, in which authors often assume that pickups are served after all deliveries has been devoted to the study of TSPD as compared to the classical TSP, and their algorithms in which used are not better. PEGA utilizes effective limbic information from father--body, uses the way of preserving the least limbic to evolution, and gains optimal path which transport costs is the lowest. The experimental result demonstrate that the proposed algorithm is very effective in solving taveling salesman problem with pickup and delivery.