A study and scrutiny of diverse optimization algorithm to solve multi-objective quadratic assignment problem
| Autor: | P. Sujatha, T. Vengattaraman, P. Dhavachelvan, Mandava Rajeswari, S. Jaiganesh |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Linear bottleneck assignment problem
0209 industrial biotechnology Mathematical optimization Computer science Quadratic assignment problem Evolutionary algorithm 02 engineering and technology Scheduling (computing) 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Metaheuristic Assignment problem Weapon target assignment problem Generalized assignment problem |
| Zdroj: | 2016 International Conference on Communication and Electronics Systems (ICCES). |
| DOI: | 10.1109/cesys.2016.7889980 |
| Popis: | Multi objective Quadratic Assignment problem is an NP-Hard complex problem for assigning facilities to locations which significantly influence the transportation cost multitude in real-world applications like facilities location, distributed computing and data analysis. QAP can be solved using metaheuristic algorithm with deterministic and local search by equalising facilities and location. QAP can be applied to decision making framework, economic problems, scheduling to assign and determine services. This work portrays the exhaustive survey of quadratic assignment problem and various methodologies to solve QAP. A comprehensive study has been carried out to solve QAP using optimization algorithms. In this survey many approaches is examined by including multiple objective flow of facilities to locations by using evolutionary algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|