جستجوی مقالات مرتبط با کلیدواژه
تکرار جستجوی کلیدواژه resource-constrained project scheduling problem در نشریات گروه فنی و مهندسی
resource-constrained project scheduling problem
در نشریات گروه برق
تکرار جستجوی کلیدواژه resource-constrained project scheduling problem در مقالات مجلات علمی
-
Scientia Iranica, Volume:27 Issue: 4, Jul Aug 2020, PP 1826 -1842Project scheduling in the resource-constrained situation is one of the key issues of project-oriented organizations. The aim of resource-constrained project scheduling problem (RCPSP) is finding a schedule with minimum makespan by considering precedence and resource constraints. RCPSP is a combinatorial optimization problem and belongs to the class of NP-hard problems. The exact methods search the entire search space and are unable to solve large-sized project networks. Thus metaheuristics are used to solve this problem with less computational time. Due to the probabilistic nature of metaheuristics, it is a challenging problem to balance between exploitation and exploration phases. The literature review shows that embedding with chaos improves both the convergence speed and the local optima avoidance of metaheuristics. This paper presents a Chaotic Vibrating Particles System (CVPS) optimization algorithm for solving the RCPSP. Vibrating Particles System (VPS) is a physic inspired metaheuristic which mimics the free vibration of single degree of freedom systems with viscous damping. The performance and applicability of the CVPS is compared with the standard VPS, and five well known algorithms on three benchmark instances of the RCPSPs Experimental studies reveals that the proposed optimization method is a promising alternative to assist project managers in dealing with RCPSP.Keywords: Resource-constrained project scheduling problem, metaheuristic algorithms, Chaotic maps, Chaotic vibrating particles system, Chaos theory, Global optimization
-
This work presents an efficient hybrid method based on Particle Swarm Optimization (PSO) and Termite Colony Optimization (TCO) for solving Resource Constrained Project Scheduling Problem (RCPSP). The search process of this hybrid method employs PSO iterations for global search and TCO iterations for local search. The proposed method works by interleaving the PSO and TCO search processes. The PSO method update schedules by considering the best solution found by the TCO approach. Next the TCO approach picks the solutions found by PSO search and perform local search around each solution. Each individual in TCO approach moves randomly but it is biased towards locally best observed solutions. Apart from hybridization, a new constraint handling approach is proposed to convert the infeasible solutions to the feasible ones. The standard benchmark problems of size j30, j60, j90, and j120 from PSPLIB are used to show the efficiency of the proposed method. The results showed that although PSO and TCO methods independently gives good solutions, the hybrid of PSO and TCO gives better solution compared to PSO and TCO methods.Keywords: particle swarm optimization, termite colony optimization, resource constrained project scheduling problem
نکته
- نتایج بر اساس تاریخ انتشار مرتب شدهاند.
- کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شدهاست. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
- در صورتی که میخواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.