Abstract
Resource-Constrained Project Scheduling Problems (RCPSP) are some of the most important scheduling problems due to their applicability to real problems and their combinatorial complexity (NP-hard). In the literature, it has been shown that metaheuristic algorithms are the main option to deal with real-size problems. Among them, population-based algorithms, especially genetic algorithms, stand out for being able to achieve the best near-optimal solutions in reasonable computational time. One of the main components of metaheuristic algorithms is the solution representation (codification) since all search strategies are implemented based on it. However, most codings are affected by generating redundant solutions, which obstruct incorporating new information. In this paper, we focus on the study of the mutation operator (responsible for diversity in the population), in order to determine how to implement this operator to reduce the obtaining of redundant solutions. The computational assessment was done on the well-known PSPLIB library and shows that the proposed algorithm reaches competitive solutions compared with the best-proposed algorithms in the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blazewicz, J., Lenstra, J., Kan, A.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11–24 (1983)
Boctor, F.F.: Resource-constrained project scheduling by simulated annealing. Int. J. Prod. Res. 34(8), 2335–2351 (1996)
Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res. 149(2), 268–281 (2003)
Chen, R.M.: Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem. Expert Syst. Appl. 38(6), 7102–7111 (2011)
Chen, W., Shi, Y.J., Teng, H.F., Lan, X.P., Hu, L.C.: An efficient hybrid algorithm for resource-constrained project scheduling. Inf. Sci. 180(6), 1031–1039 (2010)
Debels, D., De Reyck, B., Leus, R., Vanhoucke, M.: A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res. 169(2), 638–653 (2006)
Debels, D., Vanhoucke, M.: A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Oper. Res. 55(3), 457–469 (2007)
Fahmy, A., Hassan, T.M., Bassioni, H.: Improving RCPSP solutions quality with stacking justification - application with particle swarm optimization. Expert Syst. Appl. 41(13), 5870–5881 (2014)
Hartmann, S.: A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res. Logist. 49(5), 433–448 (2002)
Herroelen, W., De Reyck, B., Demeulemeester, E.: Resource-constrained project scheduling: a survey of recent developments. Comput. Oper. Res. 25(4), 279–302 (1998)
Klein, R.: Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. Eur. J. Oper. Res. 127(3), 619–638 (2000)
Kochetov, Y.A., Stolyar, A.A.: Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Workshop on Computer Science and Information Technologies CSIT 2003, Ufa, Russia (2003)
Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174(1), 23–37 (2006)
Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling library. Eur. J. Oper. Res. 96, 205–216 (1996)
Mahdi Mobini, M.D., Rabbani, M., Amalnik, M.S., Razmi, J., Rahimi-Vahed, A.R.: Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. Soft. Comput. 13(6), 597–610 (2008)
Mendes, J., Gonçalves, J., Resende, M.: A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. 36(1), 92–109 (2009)
Nonobe, K., Baraki, T.: Formulation and Tabu search algorithm for the resource constrained project scheduling problem. In: Essays and Surveys in Metaheuristics, pp. 557–588. Springer, Boston (2002). https://doi.org/10.1007/978-1-4615-1507-4_25
Paraskevopoulos, D., Tarantilis, C., Ioannou, G.: Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Syst. Appl. 39(4), 3983–3994 (2012)
Peteghem, V.V., Vanhoucke, M.: A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 201(2), 409–418 (2010)
Tormos, P., Lova, A.: A competitive heuristic solution technique for resource-constrained project scheduling. Ann. Oper. Res. 102(1–4), 65–81 (2001)
Tseng, L.Y., Chen, S.C.: A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 175(2), 707–721 (2006)
Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 185(2), 495–508 (2008)
Acknowledgements
This paper has been partially supported by the Spanish research projects TIN-2013-46511-C2-1-P and TIN2016-80856-R.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Morillo, D., Barber, F., Salido, M.A. (2018). Chromosome Mutation vs. Gene Mutation in Evolutive Approaches for Solving the Resource-Constrained Project Scheduling Problem (RCPSP). In: Mouhoub, M., Sadaoui, S., Ait Mohamed, O., Ali, M. (eds) Recent Trends and Future Technology in Applied Intelligence. IEA/AIE 2018. Lecture Notes in Computer Science(), vol 10868. Springer, Cham. https://doi.org/10.1007/978-3-319-92058-0_58
Download citation
DOI: https://doi.org/10.1007/978-3-319-92058-0_58
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92057-3
Online ISBN: 978-3-319-92058-0
eBook Packages: Computer ScienceComputer Science (R0)