电子商务下多约束有时间窗车辆问题优化研究

传统的基于行车路线最短的车辆调度优化模型难以满足电子商务物流配送实际需要,导致实际配送成本居高不下;或是过于强调线路最短,而难以按照客户的要求准时送货,失去市场竞争力。将传统车辆调度模型进行修改,以提高模型的适用性和通用性。由于车辆调度问题是NP难问题,采用改进遗传算法进行优化求解,结合具体实例,通过实验计算证明了该改进算法的良好性能。

Research on multi-constrained vehicle routing problem with time windows of optimization for electronic commerce

The optimization model on vehicle scheduling based on traditional shortest vehicle route is difficult to meet the actual needs of logistics and distribution,in fact lead to high distribution costs;or too much emphasis on the shortest line,and not in accordance with customer requirements on time delivery,loss of market competitiveness.The traditional vehicle scheduling model is modified in order to improve the applicability and universal characteristics of model.For vehicle scheduling problem is NP puzzle, get optimization solution through adopting improved genetic algorithm.It is proved that improved algorithm has good performance through experiment and calculation combining with concrete examples.