A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-AllocationProblem
محورهای موضوعی : Design of ExperimentRagheb Rahmaniani 1 , abdosalam Ghaderi 2 , Mohammad Saidi Mehrabad 3
1 - MSc, Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
2 - Assistant Professor, Department of Industrial Engineering, University of Kurdistan, P.C. 66177-15177, Sanandaj, Iran
3 - Professor, Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
کلید واژه: Single allocation, Uncertainty, Hybrid Algorithm, Capacitated Facility Location-allocationProblem,
چکیده مقاله :
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty ischaracterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs oftransportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an efficienthybrid solution algorithm based on several meta-heuristics and an exact algorithm is put forward. This algorithm generates neighborhoodsby combining the main concepts of variable neighborhood search, simulated annealing, and tabu search and finds the local optima by usingan algorithm that uses an exact method in its framework. Finally, to test the algorithms’ performance, we apply numerical experiments onboth randomly generated and standard test problems. Computational experiments show that our algorithm is more effective and efficient interm of CPU time and solutions quality in comparison with CPLEX solver.
