A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types - instance data
收藏University of Hamburg2023-12-19 更新2026-04-17 收录
下载链接：
https://www.fdr.uni-hamburg.de/record/11182
下载链接
链接失效反馈官方服务：
资源简介：
This data set includes the instances used in the paper "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types". The data set "DARP_incomp_data.zip" contains the instances for the final calculations whereas the data set "DARP_incomp_components_data.zip" includes the instances used in the preliminary test for the components.
提供机构：
Pfeiffer, Christian; Schulz, Arne
创建时间：
2023-12-19
