دانلود گزارش کارورزی و کار آموزی

چکیده : 

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering

distances and capacities for the services to be given by each median. This paper presents an efficient

hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a

tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from the current

solution to a neighbor solution, an open median is selected and closed. Then, a linear programming (LP)

model is generated by relaxing binary constraints and adding new constraints. The generated LP solution

is improved using cutting-plane inequalities. The solution of this strong LP is considered as a new neighbor

solution. In order to select an open median to be closed, several strategies are proposed. The neighborhood

structure is combined with a tabu search algorithm in the proposed approach. The parameters of the

proposed hybrid algorithm are tuned using design of experiments approach. The proposed algorithm is

tested on several sets of benchmark instances. The statistical analysis shows efficiency and effectiveness

of the hybrid algorithm in comparison with the best approach found in the literature.