An orthogonal hybrid algorithm for the resource-constrained project scheduling problem

As an effective method, the generation-based heuristic algorithm gets information from the history search at one generation, and then uses this information to generate some other solutions as the next generation so that a near optimum solution can be found. To do this effectively, how to represent a solution is a fundamental problem. After providing a new representation for a solution, a hybrid algorithm was given. The algorithm used the ideal of orthogonal design to make the solutions generating more reasonable, and used the ideal of Estimation of Distribution Algorithm to elicit the information about activity linking in a population so that the solutions with history linking information can be generated, and used the ideal of Scatter Search to keep the search process strolling in divers parts, and used the ideal of reverse schedule to improve the fitness of found solutions. The simulation results reveal the efficiency of the algorithm.