Alireza Etminaniesfahani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alireza Etminaniesfahani has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hanyu Gu
University of Technology Sydney
3 shared publications - Amir Salehipour
University of Technology Sydney
2 shared publications Hanyu Gu
School of Mathematical and Physical Sciences, University of Technology Sydney, Sydney, Australia
2 shared publications- Leila Moslemi Naeni
University of Technology Sydney
2 shared publications Amir Salehipour
1 shared publication
Latest Publications
- Open Access
- 13 April 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (4) , 356
An Efficient Hybrid Artificial Bee Colony Algorithm for the Resource-Constrained Project Scheduling Problem
The Artificial Bee Colony (ABC) is a widely used metaheuristic optimisation algorithm due to its simplicity, adaptability, and efficiency. However, it has a notable drawback of limited local search capability for combinatorial optimisation problems such as the Resource Constrained Project Scheduling Problem (RCPSP). This study employs a line search method to strengthen the local search process, focusing on refining candidate solutions in a given direction. Furthermore, Constraint Programming is embedded to deal with the large number of constraints in RCPSP and explore the complex and discrete solution space efficiently. The computational results on 1560 instances from the well-known library PSPLIB with 30, 60, and 120 tasks, indicate that the proposed algorithm yields superior outcomes compared to the state-of-the-art algorithms.
- 13 April 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (4) , 356
Open AccessAn Efficient Hybrid Artificial Bee Colony Algorithm for the Resource-Constrained Project Scheduling Problem
The Artificial Bee Colony (ABC) is a widely used metaheuristic optimisation algorithm due to its simplicity, adaptability, and efficiency. However, it has a notable drawback of limited local search capability for combinatorial optimisation problems such as the Resource Constrained Project Scheduling Problem (RCPSP). This study employs a line search method to strengthen the local search process, focusing on refining candidate solutions in a given direction. Furthermore, Constraint Programming is embedded to deal with the large number of constraints in RCPSP and explore the complex and discrete solution space efficiently. The computational results on 1560 instances from the well-known library PSPLIB with 30, 60, and 120 tasks, indicate that the proposed algorithm yields superior outcomes compared to the state-of-the-art algorithms.
- 23 December 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 338 (1) , 41-68
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
- 23 December 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 338 (1) , 41-68
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
- 17 December 2022
- Published by Springer Nature in SN Computer Science
- Vol. 4 (2) , 1-10
A Forward–Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
- 17 December 2022
- Published by Springer Nature in SN Computer Science
- Vol. 4 (2) , 1-10
A Forward–Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
- 26 March 2022
- Published by Elsevier in Journal of Computational Science
- Vol. 61
ABFIA: A hybrid algorithm based on artificial bee colony and Fibonacci indicator algorithm
- 26 March 2022
- Published by Elsevier in Journal of Computational Science
- Vol. 61
ABFIA: A hybrid algorithm based on artificial bee colony and Fibonacci indicator algorithm