Branch-and-price algorithm for fuzzy integer programming problems with block angular structure

2016 ◽  
Vol 296 ◽  
pp. 70-96 ◽  
Author(s):  
Malihe Niksirat ◽  
S. Mehdi Hashemi ◽  
Mehdi Ghatee
Keyword(s):  
Integer Programming ◽  
Branch And Price ◽  
Angular Structure ◽  
Integer Programming Problems ◽  
Price Algorithm

scholarly journals A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1211
Author(s):  
Ivona Brajević
Keyword(s):  
Integer Programming ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Minimax Problems ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Effective Performance ◽  
Complex Optimization ◽  
Overall Performance ◽  
Integer Programming Problems

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms.

Sign in / Sign up

Export Citation Format

Share Document