Artificial bee colony optimization for the quadratic assignment problem

T Dokeroglu, E Sevinc, A Cosar - Applied soft computing, 2019 - Elsevier
Abstract We propose hybrid Artificial Bee Colony (ABC) optimization algorithms for the well-
known Quadratic Assignment Problem (QAP). Large problem instances of the QAP are still …

A survey of advances in optimization methods for wireless communication system design

YF Liu, TH Chang, M Hong, Z Wu, AMC So… - arXiv preprint arXiv …, 2024 - arxiv.org
Mathematical optimization is now widely regarded as an indispensable modeling and
solution tool for the design of wireless communications systems. While optimization has …

Hybrid teaching–learning-based optimization algorithms for the quadratic assignment problem

T Dokeroglu - Computers & Industrial Engineering, 2015 - Elsevier
Abstract Teaching–Learning-Based Optimization (TLBO) is a novel swarm intelligence
metaheuristic that is reported as an efficient solution method for many optimization …

-norm Regularization Algorithms for Optimization Over Permutation Matrices

B Jiang, YF Liu, Z Wen - SIAM Journal on Optimization, 2016 - SIAM
Optimization problems over permutation matrices appear widely in facility layout, chip
design, scheduling, pattern recognition, computer vision, graph matching, etc. Since this …

Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems

T Pradeepmon, R Sridharan… - International journal of …, 2018 - m.growingscience.com
Particle swarm optimization has been established to be one of the efficient algorithms for
finding solutions for continuous optimization problems. The discretized form of particle …

Finding optimum facility's layout by developed simulated annealing algorithm

H Jafari, M Ehsanifar, A Sheykhan - International journal of research …, 2020 - riejournal.com
The Quadratic Assignment Problem (QAP) is one of the problems of combinatorial
optimization belonging to the NP-hard problems' class and has a wide application in the …

[PDF][PDF] Neutrosophic Adaptive Clustering Optimization in Genetic Algorithm and Its Application in Cubic Assignment Problem.

F Zhang, S Xu, B Han, L Zhang… - CMES-Computer Modeling …, 2023 - cdn.techscience.cn
In optimization theory, the adaptive control of the optimization process is an important goal
that people pursue. To solve this problem, this study introduces the idea of neutrosophic …

A new robust Harris Hawk optimization algorithm for large quadratic assignment problems

T Dokeroglu, YS Ozdemir - Neural Computing and Applications, 2023 - Springer
Harris Hawk optimization (HHO) is a new robust metaheuristic algorithm proposed for the
solution of large intractable combinatorial optimization problems. The hawks are cooperative …

Extreme Point Pursuit--Part II: Further Error Bound Analysis and Applications

J Liu, Y Liu, WK Ma, M Shao, AMC So - arXiv preprint arXiv:2403.06513, 2024 - arxiv.org
In the first part of this study, a convex-constrained penalized formulation was studied for a
class of constant modulus (CM) problems. In particular, the error bound techniques were …

非负正交约束优化问题的理论, 算法及应用

姜波 - 运筹学学报, 2023 - ort.shu.edu.cn
非负正交约束优化问题是同时带有非负约束和正交约束的优化问题, 该类问题在机器学习和数据
科学中有着重要的应用. 常见的非负正交约束优化问题包括二次指派问题, 图匹配问题 …