.png){kind=icon}
返回
An effective teaching-learning-based optimisation algorithm for RCPSP with ordinal interval numbers
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2014.961205.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To solve the resource-constrained project-scheduling problem (RCPSP) with ordinal interval numbers, this paper presents an effective teaching-learning-based optimisation (TLBO) algorithm. Ordinal interval number is introduced as a novel tool for handling vague information to describe the RCPSP under uncertain environment. An ordinal interval-based parallel schedule generation scheme is used to generate feasible schedules. Two new phases including the self-study phase and the exam phase are incorporated into the TLBO to enhance the teaching-learning process. In the self-study phase, the population is updated by a mutation operator to prevent premature convergence and to enhance exploration search. In the exam phase, elite students are selected to enhance exploitation search. Moreover, a novel ordinal interval resource-based crossover operator (OIRBCO) is well designed for both the teacher phase and the student phase of the TLBO. Computational comparisons between the OIRBCO and the existing two-point crossover show that OIRBCO is more effective due to the utilisation of the resource information. In addition, statistical comparisons with particle swarm optimisation and simulated annealing show that the proposed TLBO is more effective in solving the RCPSP with ordinal interval numbers.
Keyword:
teaching-learning-based optimisation
ordinal interval resource-based crossover
self-study phase
ordinal interval number
exam phase
Resource-constrained project scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
IFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets
PREAI
分享收藏
查看更多内容