DIMACS VRP Challenge
收藏arXiv2025-09-30 收录
下载链接：
http://dimacs.rutgers.edu/programs/challenge/vrp/
下载链接
链接失效反馈官方服务：
资源简介：
该数据集是为车辆路径问题带时间窗（VRPTW）而设计的一组实例，它被用于DIMACS VRP挑战赛。该数据集包含了多种用于测试旨在解决VRPTW算法的实例。这些实例的规模可达到600个客户节点。任务旨在解决带有时间窗的车辆路径问题（VRPTW）。
This dataset consists of a set of instances tailored for the Vehicle Routing Problem with Time Windows (VRPTW), and was utilized in the DIMACS VRP Challenge. It includes a variety of instances designed to test algorithms for solving VRPTW. Each instance can have up to 600 customer nodes. The core task of this dataset is to solve VRPTW.
提供机构：
DIMACS
