欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
考虑车场容量、不同车型车辆行驶最大里程等约束条件,建立以车辆配送总费用最小为目标的一类带时间窗协同车辆路径问题数学规划模型、即属于不同公司的配送中心共享车队、仓储等资源为客户协同配送货物,采用文献[1]中的自适应离散粒子群算法求解该问题并定义了其可能解的粒子的编码方式。最后,通过一个算例得出结论：同普通物流配送情形相比,本文模型求解的最佳总配送里程和费用分别有效减少24.86%和29.95%,验证了模型的正确性和合理性。
英文摘要：
Considering some constraints such as depot＇s capacity and maximum mileages of different vehicles,etc.,a mathematical programming model with time window for collaborative vehicles＇ routing to optimize total cost of dispatching was built.The distribution centers belong to different companies shares motorcade and warehousing to serve their customers.The problem was solved by self-adaptive discrete particle swarm optimization algorithm proposed in Reference [1],and the encoding strategy of particles of the potential solutions was redefined.The result based on an example shows that the optimal total distribution mileage and cost solved by the presented model can be significantly reduced by 24.86% and 29.95% respectively compared to general logistics,which proved the model＇s correctness and reasonableness.
同期刊论文项目
同项目期刊论文
位置：