遇见数据集

Kucuk and Yildiz 3L-PDP benchmark instances

收藏
Mendeley Data2024-03-27 更新2024-06-26 收录
官方服务:

资源简介:

New instances consist of 56 instances derived from the PDP instances by Li & Lim (2001) and the Container Loading Problem instances by Bischoff & Ratcliff (1995). Each instance has 100 customers and up to 5000 boxes. The geographic data in problem sets ky_lr1 and ky_lr 2 are generated randomly, while those in problem sets ky_lc1 and ky_lc2 are clustered. Problem sets ky_lrc1 and ky_lrc2 have a combination of randomly generated and clustered structures. Sets ky_lr1, ky_lc1, and ky_lrc1 have a short scheduling period, while sets ky_lr2, ky_lc2, and ky_lrc2 have a wider scheduling period, enabling multiple customers to be served by the same vehicle. The instances were created concerning the loading volume provided by a 20 ft ISO container defined as dimensions L = 587, W = 233, and H = 220. All instances have five box types, and various numbers of these boxes are randomly distributed to customers. The weight capacity of the vehicles is determined as 10786 weight units, and this limit is independent of the volume capacity. In addition, fragility and stack direction limits are randomly defined for each box type.

本次新增数据集包含56个衍生实例,其中部分源自Li与Lim(2001)提出的PDP(Pickup and Delivery Problem,接送货问题)实例,以及Bischoff与Ratcliff(1995)提出的集装箱装载问题(Container Loading Problem)实例。每个实例均包含100个客户,以及最多5000个货箱。问题集ky_lr1与ky_lr2中的地理数据为随机生成,而问题集ky_lc1与ky_lc2的地理数据则为聚类分布型。问题集ky_lrc1与ky_lrc2兼具随机生成与聚类分布的结构特征。问题集ky_lr1、ky_lc1与ky_lrc1的调度周期较短,而问题集ky_lr2、ky_lc2与ky_lrc2的调度周期更长,允许同一车辆为多位客户提供服务。本数据集实例的装载容积参照20英尺ISO标准集装箱设定,其尺寸参数为长L=587、宽W=233、高H=220。所有实例均包含5种货箱类型,各类货箱的数量随机分配至各客户节点。车辆的额定载重量设定为10786重量单位,且该载重限制与容积容量相互独立。此外,每种货箱类型的易碎性与堆叠方向限制均为随机设定。

创建时间:
2024-01-23
搜集汇总
背景与挑战
背景概述
该数据集是Kucuk和Yildiz创建的3L-PDP基准测试实例,包含56个实例,每个实例涉及100个客户和最多5000个箱子,源自现有PDP和装箱问题实例。数据集特点包括地理数据结构的多样性(随机、聚类及混合)、调度周期的不同设置,以及基于20英尺ISO集装箱尺寸的约束,如箱型、重量容量、易碎性和堆叠方向限制,适用于车辆路径和装载优化问题的研究。
以上内容由遇见数据集搜集并总结生成
二维码
社区交流群
二维码
科研交流群
商业服务