548 research outputs found

    Investigating feed mix problem approaches: An overview and potential solution

    Get PDF
    Feed is one of the factors which play an important role in determining a successful development of an aquaculture industry. It is always critical to produce the best aquaculture diet at a minimum cost in order to trim down the operational cost and gain more profit. However, the feed mix problem becomes increasingly difficult since many issues need to be considered simultaneously.Thus, the purpose of this paper is to review the current techniques used by nutritionist and researchers to tackle the issues. Additionally, this paper introduce an enhance algorithm which is deemed suitable to deal with all the issues arise. The proposed technique refers to Hybrid Genetic Algorithm which is expected to obtain the minimum cost diet for farmed animal, while satisfying nutritional requirements. Hybrid GA technique with artificial bee algorithm is expected to reduce the penalty function and provide a better solution for the feed mix problem

    Marriage in Honey Bees Optimization Algorithm for Flow-shop Problems

    Get PDF
    The objective of this work is to make a comparative study of the Marriage in Honeybees Op-timization (MBO) metaheuristic for flow-shop scheduling problems. This paper is focused on the design possibilities of the mating flight space shared by queens and drones. The proposed algorithm uses a 2-dimensional torus as an explicit mating space instead of the simulated an-nealing one in the original MBO. After testing different alternatives with benchmark datasets, the results show that the modeled and implemented metaheuristic is effective to solve flow-shop type problems, providing a new approach to solve other NP-Hard problems

    Development Of Artificial Bee Colony (Abc) Variants And Memetic Optimization Algorithms

    Get PDF
    Bio-inspired optimization algorithms (BIAs) have shown promising results in various diverse realms. One of BIAs, artificial bee colony (ABC) optimization algorithm, has shown excellent performance in many applications compared to other optimization algorithms. However, its performance sometimes deteriorates as the complexity of optimization problems increases. ABC normally has slow convergence rates on unimodal functions and yields premature convergence on complex multimodal functions. Researchers have proposed various ABC variants in order to overcome these problems. Nevertheless, the variants still fail to avoid both limitations simultaneously. Hence, this research work proposes six modified ABC variants and six memetic ABC algorithms with the aim of overcoming the problems of slow convergence rates and premature convergence. The modified ABC variants have been developed by inserting new processing stages into the standard ABC algorithm and modifying the employed-bees and onlooker-bees phases to balance out the exploration and exploitation capabilities of the algorithm. The proposed memetic ABC algorithms have been developed by hybridizing the proposed ABC variants with a local search technique, augmented evolutionary gradient search (EGS). The performances of all modified ABC variants and formulated memetic ABC algorithms have been evaluated on 27 benchmark functions. The best-performed modified ABC variants and memetic ABC algorithms are identified. To validate their robustness, the identified best-performed modified ABC variants and memetic ABC algorithms have been applied in three real-world applications; reactive power optimization (RPO), economic environmental dispatch (EED) and optimal digital IIR filter design. The obtained results have shown the superiority of the proposed optimization algorithms particularly JA-ABC5a, JA-ABC9 and EGSJAABC9 in comparison to the existing ABC variants and memetic ABC algorithm. For example, EGSJAABC9 has produced the most minimum power loss in comparison to other algorithms. Also, EGSJAABC9 has obtained the minimum EED value of 6.5593E+04 ((lb))for6generatiorunitsystemwhileJAABC9andEGSJAABC9acquiredtheleastEEDvalueof1.1656E+05((lb)) for 6-generatior unit system while JA-ABC9 and EGSJAABC9 acquired the least EED value of 1.1656E+05 ((lb)) for 10-generator unit system. Meanwhile, EGSJAABC9 has attained the best results at optimizing LP, BP and BS filters with 8.41E-03, 0.00E+00 and 5.70E-01 values of magnitude response error, respectively. As for optimizing HP filter, EGSJAABC9 is the second best. These results show that the proposed ABC variants and memetic ABC algorithms particularly EGSJAABC9 are robust optimization algorithms as they are able to converge faster and avoid premature convergence when dealing with complex optimization problems

    A Honey Bee Algorithm To Solve Quadratic Assignment Problem

    Get PDF
    Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first of all, we have been described exact methods and heuristics, which are able to solve QAP; then we have been applied a meta-heuristic algorithm for it. QAP is a difficult problem and is in NP-hard class, so we have been used honey bee mating optimization (HBMO) algorithm to solve it.This method is new and have been applied and improved NP-hard problems. It’s a hybrid algorithm from Honey-Bee Mating system, simulated annealing and genetic algorithm.</p

    A Study Of Vantage Point Neighbourhood Search In The Bees Algorithm For Combinatorial Optimization Problems

    Get PDF
    Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2014Thesis (M.Sc. ) -- İstanbul Technical University, Institute of Science and Technology, 2014Bu tez çalışmasının temel amacı arıların kaynak arama davranışlarını modelleyen arı algoritmasının, kombinatoryal uzaylarda komşuluk arama fazına yeni bir yaklaşım geliştirilmesidir. Geliştirilen yaklaşım Gezgin Satıcı Problemine uygulanarak Gezgin Satıcı Problemi çözümünün en iyilenmesi amaçlanmıştır.This thesis focuses on nature-inspired optimisation algorithms, in particular, the Bees Algorithm that developed for combinatorial domains with new local search procedure and applied to Traveller Salesman Problem (TSP). An efficient and robust local neighborhood search algorithm is proposed for combinatorial domains to increase the efficiency of the Bees Algorithm.Yüksek LisansM.Sc
    corecore