Research Article
A Memetic Algorithm for Multiskill Resource-Constrained Project Scheduling Problem under Linear Deterioration
Algorithm 4
GVNS_operator.
| Input: Initial solution ; a set of neighborhood structures | |
| ; | |
| Output: The current best solution found during GVNS | |
| process | |
| Calculate the objective value according to the eval- | |
| uation function in Section 4.1 | |
| /∗ is the current solution ∗/ | |
| /∗ is the best solution found so far∗/ | |
| /∗ counts the consecutive iterations where is not | |
| improved ∗/ | |
| repeat | |
| Generate a random sequence (SO) to apply three | |
| neighborhood structures | |
| Apply the relevant mechanism (Section 4.5.1) in pre- | |
| determined order specified by SO, update if a better | |
| configuration is attained | |
| ifthen | |
| reset the counter | |
| else | |
| end if | |
| until | |
| return |