遇见数据集

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 收录
官方服务:

资源简介:

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.

创建时间:
2023-12-19
二维码
社区交流群
二维码
科研交流群
商业服务