.png){kind=icon}
返回
Are Stacker Crane Problems easy? A statistical study
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.06.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many full truckload pick-up and delivery problems in the intermodal freight container transport industry can be modeled as Asymmetric Traveling Salesman Problems (ATSPs). Several authors have noted that while ATSPs are NP-hard, some instances are readily solved to optimality in only a short amount of time. Furthermore, the literature contains several references to the Stacker Crane Problem (SCP) as an easy problem amidst the ATSPs. We put this hypothesis to test by using statistical methods to build a model relating measurable distance matrix structures to the amount of time required by two existing exact solvers in finding solutions to over 500 ATSP instances. From this analysis we conclude that SCPs are not necessarily easier than other ATSPs, but a special subset of SCPs, termed drayage problems, are more readily solved. We speculate that drayage problems are easy because of a comparatively high number of zeros in symmetric locations within the distance matrix. In real-world drayage problems (i.e. the movement of containers a short distance to/from a port or rail terminal), these zeros correspond to the prevalence of jobs originating at or destined to a fixed number of freight terminals. (c) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Drayage
Intermodal freight
Asymmetric Traveling Salesman Problem
Traveling Salesman Problem
Stacker Crane Problem
Statistical analysis of algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏Impact of sea-level and climatic changes on the Amazon coastal wetlands during the late Holocene
PREAI
分享收藏
查看更多内容