SNCF, the French public train company, is experimenting to develop new types of transportation services by tackling vehicle routing problems. While many deep learning models have been used to tackle efficiently vehicle routing problems, it is difficult to take into account time related constraints. In this paper, we solve the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and the Capacitated Pickup and Delivery Problem with Time Windows (CPDPTW) with a constructive iterative Deep Learning algorithm. We use an Attention Encoder-Decoder structure and design a novel insertion heuristic for the feasibility check of the CPDPTW. Our models yields results that are better than best known learning solutions on the CVRPTW. We show the feasibility of deep learning techniques for solving the CPDPTW but witness the limitations of our iterative approach in terms of computational complexity.
翻译:法国公共列车公司SNCF正在尝试通过解决车辆路由问题开发新型运输服务。虽然许多深层学习模式已被用于有效解决车辆路线问题,但很难考虑到与时间有关的制约因素。本文用时间视窗(CVRPTW)解决机动车辆行驶问题,用具有建设性的迭代深层学习算法(CPDPTW)解决时视窗(CPDPTW)处理能力强的接车和交货问题。我们使用注意读取器结构,并设计了一种新颖的插入超常,用于检查CPPPTW的可行性。我们的模型产生的结果比在CVRPTW(CRPTW)方面已知的最佳学习解决办法要好。我们展示了解决CPPTW(CPTW)的深层学习技术的可行性,但见证了我们在计算复杂性方面互动方法的局限性。