Scholarlink

Solving the Stockyard Planning Problem (SPP) is a critical task in the daily business of transhipment points such as harbors where bulk material is freighted. In our previous work presented at the 21st International Conference on Informatics in Control, Automation and Robotics (ICINCO) 2024 [5] we presented a method to solve the SPP in a realistic scenario of a dry bulk port using a hybrid approach of constraint programming and greedy search algorithms. This paper proposes an extension to this method with an optimized score function and refined constraints. With this refined approach it is possible to solve more complex scenarios and the improved score function enables a more accurate representation of the reality. Additionally, we extended our test setting to validate the effectiveness of the new model.

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

A Constraint and Search-Based Approach on Fixed Time Step-Based Solving of the Stockyard Planning Problem

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Sonja Breuß,
  • Viktoria Abbenhaus,
  • Sven Löffler,
  • Petra Hofstedt

摘要

Solving the Stockyard Planning Problem (SPP) is a critical task in the daily business of transhipment points such as harbors where bulk material is freighted. In our previous work presented at the 21st International Conference on Informatics in Control, Automation and Robotics (ICINCO) 2024 [5] we presented a method to solve the SPP in a realistic scenario of a dry bulk port using a hybrid approach of constraint programming and greedy search algorithms. This paper proposes an extension to this method with an optimized score function and refined constraints. With this refined approach it is possible to solve more complex scenarios and the improved score function enables a more accurate representation of the reality. Additionally, we extended our test setting to validate the effectiveness of the new model.