遇见数据集

Instance data for "A Branch-and-Cut algorithm for an urban dial-a-ride problem" and "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems"

收藏
University of Hamburg2022-08-01 更新2026-04-17 收录
官方服务:

资源简介:

This data set includes the instances used in the paper "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems" and the corresponding preprint "A Branch-and-Cut algorithm for an urban dial-a-ride problem". The data set "DARP_TW_data.zip" contains the instances for the final calculations whereas the data set "DARP_TW_components_data.zip" includes the instances used in the preliminary test for the components.

创建时间:
2022-08-01
二维码
社区交流群
二维码
科研交流群
商业服务