five

Exploiting travel sequences to optimise facility layouts with multiple input/output points

收藏
Taylor & Francis Group2025-05-12 更新2026-04-16 收录
下载链接:
https://tandf.figshare.com/articles/dataset/Exploiting_travel_sequences_to_optimise_facility_layouts_with_multiple_input_output_points/28093563/1
下载链接
链接失效反馈
官方服务:
资源简介:
The facility layout problem (FLP) involves arranging departments on a shop floor to optimise specific objectives, traditionally focussing on pairwise flows between departments. However, these methods often underestimate total travel distances, especially when flows involve multiple input/output points and visits to more than two departments. To address this, connected movements – actual routes taken by transporters – must be considered. This study uses data captured from an Internet of Things (IoT) network and stored on cloud servers to analyze worker movements and accurately calculate travel distances. A mixed-integer programming model is proposed to minimise total travel distance using connected movements as input. Due to the problem's complexity, a biased random key genetic algorithm is employed to find optimal layouts. A case study at a fertiliser production company demonstrates the effectiveness of the approach, achieving a 15% reduction in travel distance compared to layouts generated by traditional methods. The IoT-enabled method also minimises productivity losses by optimising worker movements. While the study focuses on fertiliser manufacturing, the findings are applicable to other settings, such as warehousing, where complex movement sequences and multiple IO points are common in processes like picking, packing, and shipping.
提供机构:
Khalilabadi, Seyyed Mahdi Ghorashi; Roy, Debjit; de Koster, René
创建时间:
2024-12-26
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

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

二维码
科研交流群

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

数据驱动未来

携手共赢发展

商业合作