Scholarlink

This paper deals with the gantry cranes problem scheduling at a container terminal. The scheduling of this equipment aims to minimize container assignment time for two different operations. A mixed integer linear programming model is developed to minimize execution time. An optimized greedy heuristic algorithm (GHA) is also applied to solve this problem, with a new best-scheduling update strategy included to improve solution stability. Results show that the proposed GHA efficiently solves the RTG cranes scheduling problem.

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

Adaptive Greedy Heuristic Algorithm for Rubber Tyred Gantry Crane Scheduling Problem at Container Terminal

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Saber Ben Zina,
  • Abdelkarim Elloumi,
  • Alain Quilliot

摘要

This paper deals with the gantry cranes problem scheduling at a container terminal. The scheduling of this equipment aims to minimize container assignment time for two different operations. A mixed integer linear programming model is developed to minimize execution time. An optimized greedy heuristic algorithm (GHA) is also applied to solve this problem, with a new best-scheduling update strategy included to improve solution stability. Results show that the proposed GHA efficiently solves the RTG cranes scheduling problem.