.png){kind=icon}
返回
A heuristic manipulation technique for the sequential ordering problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2007.05.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is feasible if these constraints are respected, and the objective is to find a feasible solution with minimum cost. The sequential ordering problem models many real-world applications, mainly in the fields of transportation and production planning. A problem manipulation technique to be used in conjunction with heuristic algorithms is discussed. The aim of the technique is to make the search space associated with each problem more attractive for the underlying heuristic algorithms. This novel methodology is tested in combination with the state-of-the-art method for the sequential ordering problem. Improved results are obtained, particularly for the largest problems considered. (c) 2007 Elsevier Ltd. All rights reserved.
Keyword:
problem manipulation techniques
Ant Colony Optimization
asymmetric travelling salesman
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Effect of deep cryogenic treatment on carbon segregation in Cr8Mo2SiV tool steel during tempering
PREAI
分享收藏
没有更多内容
没有更多内容