.png){kind=icon}
返回
Natural Optimization Algorithms for the Cross-Dock Door Assignment Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TITS.2016.2519104.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cross-docking is a practice in logistics in which shipments are directly moved from an inbound truck into an outbound truck. A recognized problem in this domain is the assignment of trucks to doors in a way that the distance to be traveled between the doors is minimized. This problem is known as the cross-dock door assignment problem (CDAP). The purpose of this paper is to present a novel algorithm that minimizes the traveling distance of the handling machines when moving cargo from an inbound truck to an outbound truck. A lot of research has been conducted regarding this topic;
still, up to our knowledge, none used scatter search (SS). This paper modifies a classical mathematical model that represents the CDAP and implements an evolutionary metaheuristic SS algorithm and tests it and then compares the results with those of another evolutionary algorithm, i.e., genetic algorithm (GA). The results indicate that the SS algorithm outperformed the GA, particularly for large-sized problems with a diverse reference set.
Keyword:
Cross-docking
door assignment problem
scatter search
genetic algorithm
logistics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.4
论文数:
9.5K
被引数:
6.3W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain供应链中具有交叉对接的位置和路线调度问题的混合模拟退火算法
PREAI
分享收藏
查看更多内容