Resource Allocation Optimization with Multi-resource Operations Considering Transportation Time
In response to resource allocation with multi-resource operations widely present in practical applications such as manufacturing and services,considering the transportation time of parts and mobile resources,a novel resource allocation mixed-integer linear programming model is formulated with the objective of minimizing the makespan.Furthermore,considering the characteristics of this problem,a hybrid algorithm combining Variable Neighborhood Search(VNS)and Simulated Annealing(SA)is proposed.This algorithm leverages the strong local search capability of VNS and the global optimization advantage of SA,overcoming the issue of VNS getting trapped in local optima and SA's slow convergence.In terms of algorithm design,adaptive neighborhood structure and improved cooling functions are incorpo-rated to speed up the convergence.Experimental results on 300 randomly generated instances show that the proposed algorithm outperforms CPLEX,Variable Neighborhood Search and Simulated Annealing algorithms alone in solving large-scale instances,providing better resource allocation solutions.
万方数据
维普
