配送选址-多车型运输路径优化问题及求解算法

Distribution Location-routing Problem of Heterotypic Vehicles and its Algorithms

考虑到不同车型、车辆容量、时间窗等约束,研究了配送选址-多车型运输路径优化问题,采用分解法进行问题分析,建立数学模型。首先应用改进聚类分析模型确定配送中心的最佳位置与服务客户群,然后设计遗传算法进行求解。算法比较及算例测试表明它是求解选址-多车型运输路径优化问题的一种有效方法。

Distribution location-routing problem of heterotypic vehicles was considered, which contains heterotypic vehicles restriction, the vehicle capacity restriction, time windows restriction. A mathematic model of the problem was established by using the decomposition method for analysis. First, the locations of distribution centers and group of customers were determined by using improved model based on clustering analysis, and then genetic algorithm was used to solve the problem. Comparison of algorithms and test example show this method can solve location-routing problem of heterotypic vehicles effectively.