Best-Order Crossover in an Evolutionary Approach to Multi-Mode Resource-Constrained Project Scheduling

Authors

  • Anca Andreica Department of Computer Science, Babes-Bolyai University Kogalniceanu 1, 400084 Cluj-Napoca, Romania
  • Camelia Chira Department of Computer Science and Centre for the Study of Complexity Babes-Bolyai University Kogalniceanu 1, 400084 Cluj-Napoca, Romania

Keywords:

multi-mode resource-constrained project scheduling, evolutionary algorithm, crossover, permutation based encoding, best individual

Abstract

Multi-Mode Resource-Constrained Project Scheduling is an NP-hard optimization problem intensively studied due to its large area of applications. This paper concentrates on the evolutionary approaches to Multi-Mode Resource-Constrained Project Scheduling based on permutation encoded individuals. A new recombination operator is presented and a comparative analysis of several recombination operators is given based on computational experiments for several project instances. Numerical results emphasize a good performance of the proposed crossover scheme which takes into account information from the global best individual besides the genetic material from parents.

Downloads

Download data is not yet available.

Downloads

Published

2014-04-01

How to Cite

Anca Andreica, & Camelia Chira. (2014). Best-Order Crossover in an Evolutionary Approach to Multi-Mode Resource-Constrained Project Scheduling. International Journal of Computer Information Systems and Industrial Management Applications, 6, 10. Retrieved from https://cspub-ijcisim.org/index.php/ijcisim/article/view/264

Issue

Section

Original Articles