A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible cust...

Name: A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible cust...
Published: 2026-04-28T16:55:20+08:00

B2FIND2026-04-28 收录

拨号乘车调度优化

约束车辆路径规划

数据链接：

https://b2find.eudat.eu/dataset/1b9ba4ee-2e4e-5c4a-a113-c69b777432e3 数据链接链接失效反馈

官方服务：

资源简介：

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...

A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible cust...

资源简介：

相关数据集