A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
Publish Year: 1391
نوع سند: مقاله ژورنالی
زبان: English
View: 346
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-5-10_006
تاریخ نمایه سازی: 22 آبان 1397
Abstract:
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an efficient hybrid solution algorithm based on several meta-heuristics and an exact algorithm is put forward. This algorithm generates neighborhoods by combining the main concepts of variable neighborhood search, simulated annealing, and tabu search and finds the local optima by using an algorithm that uses an exact method in its framework. Finally, to test the algorithms’ performance, we apply numerical experiments on both randomly generated and standard test problems. Computational experiments show that our algorithm is more effective and efficient in term of CPU time and solutions quality in comparison with CPLEX solver.
Keywords:
Authors
Ragheb Rahmaniani
MSc, Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Abdolsalam Ghaderi
Assistant Professor, Department of Industrial Engineering, University of Kurdistan, P.C. ۶۶۱۷۷-۱۵۱۷۷, Sanandaj, Iran
Mohammad Saidi-Mehrabad
Professor, Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran