集配货一体化的多站点定位路线问题

Multi-depot location routing problem in pickups and deliveries integration

针对客户同时有集货和送货需求时的定位路线问题,建立数学模型,设计两阶段启发式算法。第一阶段为定位配给问题,采用禁忌搜索算法,避免陷入局部最优;第二阶段为集配货一体化车辆路线问题,采用模拟退火算法,具有强收敛性,可以得到全局优化解;然后将两个阶段进行很多次循环迭代最终求得集配货一体化多站点定位路线问题的优化解。通过实例计算验证该启发式算法的可行性和有效性。

For the location routing problem when a customer has both collection and delivery demand, the mathematical model is set up. A two-phase heuristic algorithm is designed to solve this problem. At the first phase, tabu search algorithm is used to avoid falling into local optimum. At the second phase, simulated annealing algorithm with strong convergence is used to reach the global optimal solution. By a large number of iterative between these two phases, the optimize solution of the location routing problem can be obtained. Lastly, it shows that the heuristic algorithm is feasible and effective.