多车场多配送中心半开放式满载车辆路径问题研究

Study on a Multi-depots Multi-distribution Centers Semi-open Vehicle Routing Problem with Full-truckload

文章研究一个多车场多配送中心的半开放式满载车辆路径问题。在任务配送过程中需要考虑车辆的启动费用、里程限制等约束条件,在不超过车辆里程限制的基础上车辆可返回配送中心进行二次配送。建立了此类问题的数学模型,设计了解决该问题的遗传算法,并通过例子对遗传算法进行了说明。结果表明文章给出的遗传算法对解决带里程限制的多车场、多配送中心半开放式满载车辆路径问题是可行的。

In this paper, a multi-depot, multi-distribution centers semi-open vehicle routing problem with full-truckload is dis- cussed. In the process of delivery, the start-up cost. driving distance restriction and other constraints need to be considered, and the vehicles can return to the disiribution center for the secondary distribution if their driving distances are less or equal to the driving distance restriction. An integer programming model for this problem is established, a genetic algorithm is given to solve it, and the genetic algorithm is illustrated, The results show that the genetic algorithm given in this paper to solve the multi-depot, muhi-distribution centers semi-open vehicle routing problem with full-truckload and driving distance restriction is feasible.