• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利：CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法，用中文像聊天一样搜索，搜遍4000万医学文献。AI智能推荐，让科研检索更轻松。

立即免费搜索

文件翻译

保留排版，准确专业，支持PDF/Word/PPT等文件格式，支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述，25分钟生成高质量综述，智能提取关键信息，辅助科研写作。

立即免费体验

具有同时取货和送货、可变成本及禁行路径的非对称聚类车辆路径问题的基准数据集

Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.

作者信息

Osaba Eneko

机构信息

Tecnalia Research & Innovation, Parque Cientifico y Tecnologico de Bizkaia, Geldo Auzoa, 700 Building, 48160, Derio, Vizcaya, Spain.

出版信息

Data Brief. 2020 Jan 28;29:105142. doi: 10.1016/j.dib.2020.105142. eCollection 2020 Apr.

DOI:10.1016/j.dib.2020.105142
PMID:32055657
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7005518/
Abstract

In this paper, the benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths is presented (AC-VRP-SPDVCFP). This problem is a specific multi-attribute variant of the well-known Vehicle Routing Problem, and it has been originally built for modelling and solving a real-world newspaper distribution problem with recycling policies. The whole benchmark is composed by 15 instances comprised by 50-100 nodes. For the design of this dataset, real geographical positions have been used, located in the province of Bizkaia, Spain. A deep description of the benchmark is provided in this paper, aiming at extending the details and experimentation given in the paper (Osaba et al.) [1]. The dataset is publicly available for its use and modification.

摘要

本文提出了具有同时取货和送货、可变成本以及禁止路径的非对称聚类车辆路径问题的基准数据集（AC-VRP-SPDVCFP）。该问题是著名车辆路径问题的一个特定多属性变体，最初是为了对具有回收政策的现实世界报纸配送问题进行建模和求解而构建的。整个基准数据集由15个实例组成，包含50 - 100个节点。在设计这个数据集时，使用了位于西班牙比斯开省的实际地理位置。本文对该基准数据集进行了深入描述，旨在扩展论文（奥萨巴等人）[1]中给出的细节和实验。该数据集可供公众使用和修改。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/68d9/7005518/04be41e87fb8/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/68d9/7005518/76909b9dabf5/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/68d9/7005518/04be41e87fb8/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/68d9/7005518/76909b9dabf5/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/68d9/7005518/04be41e87fb8/gr2.jpg

相似文献

1
Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.具有同时取货和送货、可变成本及禁行路径的非对称聚类车辆路径问题的基准数据集
Data Brief. 2020 Jan 28;29:105142. doi: 10.1016/j.dib.2020.105142. eCollection 2020 Apr.
2
Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms.具有同时交付和取货以及时间窗的多目标车辆路径问题：公式、实例和算法。
IEEE Trans Cybern. 2016 Mar;46(3):582-94. doi: 10.1109/TCYB.2015.2409837. Epub 2015 Mar 18.
3
Dynamic vehicle routing with time windows in theory and practice.带时间窗的动态车辆路径规划：理论与实践
Nat Comput. 2017;16(1):119-134. doi: 10.1007/s11047-016-9550-9. Epub 2016 Apr 9.
4
A discrete wild horse optimizer for capacitated vehicle routing problem.一种用于容量车辆路径问题的离散野马优化器。
Sci Rep. 2024 Sep 11;14(1):21277. doi: 10.1038/s41598-024-72242-0.
5
Benchmark dataset for multi depot vehicle routing problem with road capacity and damage road consideration for humanitarian operation in critical supply delivery.用于关键物资交付中人道主义行动的、考虑道路容量和受损道路的多配送中心车辆路径问题的基准数据集。
Data Brief. 2022 Feb 2;41:107901. doi: 10.1016/j.dib.2022.107901. eCollection 2022 Apr.
6
A set-covering based heuristic algorithm for the periodic vehicle routing problem.一种基于集合覆盖的周期性车辆路径问题启发式算法。
Discrete Appl Math. 2014 Jan 30;163(Pt 1):53-64. doi: 10.1016/j.dam.2012.08.032.
7
Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.按订单拆分交付的带距离约束的车辆路径问题的禁忌搜索算法。
PLoS One. 2018 May 15;13(5):e0195457. doi: 10.1371/journal.pone.0195457. eCollection 2018.
8
Dataset for the van-drone routing problem with multiple delivery drop points.具有多个投递点的厢式无人机路径规划问题的数据集。
Data Brief. 2023 Apr 29;48:109192. doi: 10.1016/j.dib.2023.109192. eCollection 2023 Jun.
9
Developing an applied algorithm for multi-trip vehicle routing problem with time windows in urban waste collection: A case study.开发城市垃圾收集多趟车辆路径问题的应用算法：案例研究。
Waste Manag Res. 2019 Jan;37(1_suppl):4-13. doi: 10.1177/0734242X18807001.
10
A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm.一个带时间窗的容量受限多取货点在线食品配送问题：一种分支定界算法。
Ann Oper Res. 2021 Jun 10:1-22. doi: 10.1007/s10479-021-04145-6.