five

Extended Problem Instances with Sturdiness Levels and Computational Results for Joint Order Batching and Picker Routing Problem

收藏
Mendeley Data2026-04-09 收录
下载链接:
https://data.mendeley.com/datasets/gvbb396xvm/2
下载链接
链接失效反馈
官方服务:
资源简介:
The problem instances used in this paper are imported from Briant et al. (2020) and Valle et al. (2017), as their studies were based on a dataset from a Foodmart factory. The benchmark is well-prepared and described in detail in Valle et al. (2017), which is produced from a database of anonymized customer purchases over two years for a chain of supermarkets. We extended this dataset by randomly adding a sturdiness level to each item. We also provide our results of the new extension of the problem of Joint Order Batching and Picker Routing Problem with Sturdiness Levels

本文所使用的问题实例援引自Briant等人(2020)与Valle等人(2017)的研究,上述两项工作均基于Foodmart工厂的数据集构建。该基准数据集筹备完备,Valle等人(2017)已对其进行了详细说明:该数据集源自某连锁超市两年期的匿名顾客购买行为数据库。我们通过为每个商品随机赋予坚固性等级的方式对该数据集进行了扩展。同时,本文还提供了带坚固性等级的联合订单分批与拣选路径规划问题新扩展版本的求解结果。
提供机构:
Marmara Universitesi
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作