Scholarlink

<p>This study focuses on an industrial facility’s time-slot allotment (TSA) problem, where loading and unloading docks are assigned to the incoming lorries, reducing the number of them waiting for service. Several constraints apply to the different dock stations, including disparate timetables and task duration, various capacities of simultaneous services, etc. Evolutionary algorithms cope with the enormous variability of the combinatorial problem, maximizing the number of accepted lorries while decreasing the queue at the entrance. Interestingly, the problem’s structure led to unconventional operator probabilities, which also analyzes the evolutionary techniques and operators included in this study. Comparative analysis with state-of-the-art methods highlights the algorithm’s effectiveness, though computational demands rise with population size.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Optimizing time slot allocation in complex multi-dock truck loading and unloading operations using evolutionary algorithms

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年6月26日

查看全文
  • Enol García González,
  • José R. Villar,
  • Javier Sedano,
  • Camelia Chira

摘要

This study focuses on an industrial facility’s time-slot allotment (TSA) problem, where loading and unloading docks are assigned to the incoming lorries, reducing the number of them waiting for service. Several constraints apply to the different dock stations, including disparate timetables and task duration, various capacities of simultaneous services, etc. Evolutionary algorithms cope with the enormous variability of the combinatorial problem, maximizing the number of accepted lorries while decreasing the queue at the entrance. Interestingly, the problem’s structure led to unconventional operator probabilities, which also analyzes the evolutionary techniques and operators included in this study. Comparative analysis with state-of-the-art methods highlights the algorithm’s effectiveness, though computational demands rise with population size.