Dynamic Takt Time Decisions for Paced Assembly Lines Balancing and Sequencing Considering Highly Mixed-model Production: An Improved Artificial Bee Colony Optimization Approach

2021 ◽  
pp. 107616
Author(s):  
Wei Zhang ◽  
Liang Hou ◽  
Roger J. Jiao
2011 ◽  
Vol 56 ◽  
pp. 163-173
Author(s):  
Alfonsas Misevičius ◽  
Jonas Blonskis ◽  
Vytautas Bukšnaitis

Straipsnyje nagrinėjami klausimai, susiję su naujoviškų metodų taikymu sprendžiant optimizavimo uždavinius. Šiuo konkrečiu atveju diskutuojama apie bičių spiečių elgsenos imitavimą ir galimą jo taikymą kombinatorinio (diskretinio) tipo optimizavimo uždaviniams. Straipsnio pradžioje aptariami konceptualūs aspektai ir bendroji bičių spiečių imitavimo algoritmų idėja. Aprašoma bičių spiečiaus imitavimo algoritmo realizacija atskiram nagrinėjamam atvejui – kvadratinio paskirstymo uždaviniui, kuris yra vienas iš aktualių ir sudėtingų kombinatorinio optimizavimo uždavinių pavyzdžių. Straipsnyje pateikiami ir su realizuotu algoritmu atliktų eksperimentų rezultatai, kurie iliustruoja skirtingų veiksnių (parametrų) įtaką gaunamų sprendinių kokybei ir patvirtina aukštą algoritmo efektyvumo lygį.Bee Swarm Intelligence in (Combinatorial) OptimizationAlfonsas Misevičius, Jonas Blonskis, Vytautas Bukšnaitis SummaryIn this paper, we discuss some issues related to the innovative intelligent optimization methods. More precisely, we are concerned with the bee colony optimization approach, which is inspired by the behaviour of natural swarms of honey bees. Both the conceptual methodological facets of the swarm intelligence paradigm and the aspects of implementation of the artificial bee colony algorithms are considered. In particular, we introduce an implementation of the artificial bee colony optimization algorithm for the well-known combinatorial optimization problem of quadratic assignment (QAP). The results of computational experiments with different variants of the implemented algorithm are also presented and discussed. Based on the obtained results, it is concluded that the proposed algorithm may compete with other efficient heuristic techniques. 


Author(s):  
L. S. Suma ◽  
S. S. Vinod Chandra

In this work, we have developed an optimization framework for digging out common structural patterns inherent in DNA binding proteins. A novel variant of the artificial bee colony optimization algorithm is proposed to improve the exploitation process. Experiments on four benchmark objective functions for different dimensions proved the speedier convergence of the algorithm. Also, it has generated optimum features of Helix Turn Helix structural pattern based on the objective function defined with occurrence count on secondary structure. The proposed algorithm outperformed the compared methods in convergence speed and the quality of generated motif features. The motif locations obtained using the derived common pattern are compared with the results of two other motif detection tools. 92% of tested proteins have produced matching locations with the results of the compared methods. The performance of the approach was analyzed with various measures and observed higher sensitivity, specificity and area under the curve values. A novel strategy for druggability finding by docking studies, targeting the motif locations is also discussed.


Sign in / Sign up

Export Citation Format

Share Document