返回
Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm
DOI:10.1016/j.eswa.2011.09.062.png)
摘要
En 中文
There are various scheduling problems with resource limitations and constraints in the literature that can be modeled as variations of the Resource Constrained Project Scheduling Problem (RCPSP). This paper proposes a new solution representation and an evolutionary algorithm for solving the RCPSP. The representation scheme is based on an ordered list of events, that are sets of activities that start (or finish) at the same time. The proposed solution methodology, namely SAILS, operates on the event list and relies on a scatter search framework. The latter incorporates an Adaptive Iterated Local Search (AILS), as an improvement method, and integrates an event-list based solution combination method. AILS utilizes new enriched neighborhoods, guides the search via a long term memory and applies an efficient perturbation strategy. Computational results on benchmark instances of the literature indicate that both AILS and SAILS produce consistently high quality solutions, while the best results are derived for most problem data sets. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Project scheduling
Resource constraints
Evolutionary algorithms
Iterated Local Search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
A hybrid genetic algorithm for the resource-constrained project scheduling problem一种求解资源受限项目调度问题的混合遗传算法

