Capacitated Competitive Facility Location Problem

Figshare2018-02-19 更新2026-04-08 收录

竞争性设施选址

运筹优化

数据链接：

https://figshare.com/articles/dataset/Capacitated_Competitive_Facility_Location_Problem/5548594/2 数据链接链接失效反馈

官方服务：

资源简介：

Data set for Capacitated Competitive Facility Location Problem including seven problem instances with different sizes

创建时间：

2018-02-19

TSP and CVRP

运筹优化

路径规划

该数据集包含了为旅行商问题（TSP）和有容量限制的车辆路径问题（CVRP）生成的实例，节点数量分别为20、50和100。城市位置的坐标是从均匀分布中抽取的，对于CVRP问题，还指定了车辆容量和需求。该数据集使用二维欧几里得距离生成实例，旨在最小化总旅行距离，并包含了针对CVRP以及其他四个提及的路径问题的特定设置。数据集的规模分为20、50和100个节点，其任务旨在解决车辆路径问题。

arXiv330

Instances for the Capacitated Mobile Facility Location Problem

运筹优化

设施定位

These data files correspond to p-med instances in Raghavan, S., Sahin, M., and Salman, F. S., "The Capacitated Mobile Facility Location Problem", published in the European Journal of Operati

doi.org70

GOAS

订单接受与调度

运筹优化

This data set includes the test instances used in the paper titled"A Matheuristic for the Generalized Order Acceptance and Scheduling Problem" (Tarhan and Oğuz).

Mendeley Data2021-04-13 更新60

Multi-Cycle Knapsack Problem (MCMKP)

运筹优化

算法评估

该数据集是针对多周期变体的多背包问题（MKP）设计的，旨在评估不同分配策略之间的权衡。该数据集包含由随机任务和代理生成的实例，任务和代理的权重和利润基于均匀分布。规模根据生成的实例而变化，其任务是为具有轮换多样性的分配问题进行优化。

arXiv90

Passing Capacity Calculation Method for High-Speed Railway Hub Stations

高速铁路

运筹优化

This study introduces a novel method for calculating the station passing capacity at high-speed railway hubs, taking into account different train path types. To distinguish the capacity for each train

DataCite Commons2025-04-27 更新70

Capacitated Competitive Facility Location Problem

资源简介：

相关数据集