Intern alternate shift arrangement method and system based on random neighborhood search algorithm

The invention provides an intern alternate shift arrangement method and system based on a random neighborhood search algorithm, and the method comprises the steps: building an objective function based on a quadratic integer programming model, and determining constraint conditions which need to be satisfied by intern alternate shift arrangement; randomly generating an initial solution meeting all the rigid constraints of the intern shift arrangement, and taking the initial solution as a current optimal solution; based on the current optimal solution, performing iterative solution by using a random neighborhood search algorithm until a preset iteration condition is met; wherein the random neighborhood search algorithm specifically comprises the following steps of: transforming the current optimal solution by using a search operator to obtain a temporary solution, and replacing the current optimal solution by using the temporary solution if the target function value of the temporary solution is smaller than that