استعمال خوارزمية البحث المتناغم المركبة لحل مسالة التخصيص التربيعية مع تطبيق عملي == Using Combinatorial Harmony Search Algorithm For Solving Quadratic Assignment Problems With Practical Application

Author name: حسن عبد الستار ابراهيم
Supervisor name: عبد المنعم كاظم حمادي الشكري
General topic: Administration and Economics
Specific topic: Operations Research
Degree: Master
University: University of Baghdad - Faculty Of Administration And Economics - Department Of Statistics
Language: Arabic
University location: Baghdad
First pages: 07T3536 - p.pdf
Abstract: يتضمن هذا البحث ثلاث مراحل اساسية المرحلة الاولى تضمنت دراسة موسعة لمسالة التخصيص التربيعية (Quadratic Assignment Problem) من حيث الصيغ وطرق الحل والحدود الدنيا لدالة الهدف وبعض التطبيقات المهمة للمسالة والمرحلة الثانية تتضمن بناء خوارزمية لحل المسالة , ا | This research includes three Basic phases the first phase included an extensive study of the Quadratic Assignment Problem (QAP) in the formulas and methods of solution and Lower Bound of objective function and some important applications of the Problem and the second phase includes construction of algorithm for solving the Problem, used Harmony Search algorithm in this research but added the improvement Procedures to increase the Performance of algorithm and speed up access to the optimal solution of the problem, The algorithm consists of two phases, the first phase will improve all the existing solutions in the Harmony Memory use some improvement measures is the property of Crossover used in genetic algorithm and also guided search to reduce the objective function, the second phase will depend on the Procedures of the Harmony search algorithm (HS) but using a new Improvise, The algorithm has proven its efficiency in solving the problem is resolved (15) standard problem from the special library of Quadratic Assignment Problem (QAPLIB), and compare the results with the local search algorithm (LS), Tabu search (TS), Simulated annealing (SA) after solving each problem (25) times and record the results of the algorithm shown open her with total access to the optimal solution (282) of the total (375) repetition of the test as the total reached the local search algorithm (2) Simulated annealing algorithm (117) and Tabu search algorithm is (174). The third phase of the research included the use of the (QAP) in the process of designing websites towers networks of the Ministry of Oil to connect the gas stations in Baghdad province to determine the main towers of the project where the use of the Combinational Harmony search algorithm in resolving the Problem after resolving the problem was determine the location of towers , sites first tower area (Yarmouk) as the second tower (Sadr City) and the third tower in the area (Karada) and fourth in the Tower (Adhamiya) and then use the Generalized Assignment model in distribution subsidiary turrets to The main tower and the new design of the towers the effectiveness of Quadratic Assignment problem in organizing sites.
Logo