堆栈(抽象数据类型)
计算机科学
容器(类型理论)
解算器
钥匙(锁)
火车
数学优化
资源配置
计算
整数(计算机科学)
分布式计算
计算机网络
工程类
算法
操作系统
数学
机械工程
地图学
程序设计语言
地理
作者
Dung‐Ying Lin,Yu-Jie Kong,ManWo Ng
标识
DOI:10.1080/01605682.2023.2294861
摘要
This paper introduces and solves a real-world problem that arises at container ports, namely the double stack railcar allocation problem. The key challenge in the double stack railcar allocation problem is to balance the number of containers loaded and the railcar usage, while respecting the loading constraints for double stack trains. To capture the key characteristics of the double stack railcar allocation problem, an integer linear optimization model is presented. The model is found to be computationally prohibitive for a state-of-the-art off-the-shelf solver (CPLEX). Hence, a tailored solution method is proposed that manages to drastically reduce the computation times, sometimes by more than 99%. In a detailed case study, insights into the double stack railcar allocation problem are revealed and discussed.
科研通智能强力驱动
Strongly Powered by AbleSci AI