Optimization of Benchmark Functions using VTS-ABC Algorithm

Performance Access of Criterion Functions using VTS-ABC Algorithm

Twinkle Gupta and Dharmender Kumar

Abstract– A new alternative based on clash alternative alleged VTS-ABC algorithm is provided in this paper. Its achievement is compared with accepted ABC algorithm with altered admeasurement of abstracts on several Criterion functions and after-effects appearance that VTS-ABC provides bigger affection of band-aid than aboriginal ABC algorithm in every case.

Keywords Artificial Bee Antecedents Algorithms, Nature-Inspired Meta-heuristics,Optimizations, Army Intelligence Algorithms, Clash selection.

NOMENCLATURE

ABC – Bogus Bee Colony

ACO – Ant Antecedents Optimization

BFS – Blocking Flow-Shop Scheduling

DE – Differential Evolution

EA – Evolutionary Algorithm

GA – Genetic Algorithm

MCN – Best Aeon Number

PSO – Particle Army Optimization

TS – Clash size

TSP – Travelling Salesman Problem

1.INTRODUCTION

For access problems, assorted algorithms havebeendesigned which are basedonnature-inspiredconcepts [1].Evolutionary algorithms(EA) and swarmoptimizationalgorithmsare two altered classes in which attributes aggressive algorithms are classified.Evolutionary algorithms like Geneticalgorithms (GA)andDifferentialevolution (DE) attack to backpack out the abnormality ofnaturalevolution [2]. However, a army like ant colony, a army of birds can be declared as accumulating of interacting agents and their intelligence lieintheir way of interactions with alternative individuals andtheenvironment [3]. Army access includes Particle army access (PSO) modelon socialbehaviorofbirdflocking [4], Antcolony access (ACO) archetypal on swarmofants and Bogus Bee Antecedents (ABC) archetypal on the able foraging behaviour of honey bees [5]. Some important characteristics of ABC algorithm which makesitmoreattractivethanotheroptimizationalgorithms are:


  1. Employs alone three ascendancy ambit (population size, best aeon cardinal and limit) [6].

  2. Fastconvergencespeed.
  3. Quite simple, adjustable and able-bodied [7] [8].
  4. Easyintegrationwithotheroptimizationalgorithms.

Therefore, ABC algorithm is a actual accepted attributes aggressive meta-heuristic algorithm acclimated to break assorted kinds of access problems. In contempo years, ABC has becoming so abundant accepting and acclimated broadly in assorted appliance such as: Accountable optimization, Image processing, Clustering, Engineering Design, Blocking breeze boutique scheduling (BFS), TSP, Bioinformatics, Scheduling and abounding others [9]-[18].Similar to alternative academic population-based approaches like GA, Ant Antecedents etc. ABC algorithm additionally activated Roulette Caster alternative apparatus which chooses best band-aid consistently with aerial alternative burden and leads the algorithm into abortive convergence. With ever-growing admeasurement of dataset, access of algorithm has become a big concern. This calls for a charge of bigger algorithm.

The aim of this cardboard is to actualize such an algorithm alleged VTS-ABC algorithm. This new alternative is based on clash alternative apparatus and selects capricious clash admeasurement anniversary time in adjustment to baddest the active bees administration their advice with beholder bees. Beholder bees baddest band-aid from alleged clash admeasurement of solutions with beneath alternative burden so that aerial fettle solutions can’t boss and accord bigger affection of solutions with ample abstracts set as well. A affliction band-aid is additionally replaced by bigger band-aid generated about in anniversary cycle.

Rest of the cardboard is disconnected in altered sections as follows: Introduction to accepted ABC algorithm is declared in breadth 2. Breadth 3 describes the proposed VTS-ABC algorithm. Experiments and its simulation after-effects to appearance achievement on several Criterion functions are declared in breadth 4 and in the last; Conclusion of the cardboard is discussed.

2.ARTIFICIAL BEE COLONY ALGORITHM

In 2005, Karaboga firstly proposed Bogus Bee Antecedents algorithm for optimizing after problems [19] which includes active bees, beholder bees and scouts. The bee accustomed out chase about is accepted as a scout. The bee activity to the aliment antecedent visited by it afore and administration its advice with beholder bees is accepted as active bee and the bee cat-and-mouse on the ball breadth alleged beholder bee. ABC algorithm as a aggregate intelligence analytic archetypal has three capital components: Active bees, Unemployed bees (onlooker and advance bees) and Aliment sources. In the appearance of access problem, a aliment antecedent represents a accessible solution. The position of a acceptable aliment antecedent indicates the band-aid accouterment bigger after-effects to the accustomed access problem. The affection of ambrosia of a aliment antecedent represents the fettle amount of the associated solution.

Initially, a about broadcast aliment antecedent position of SNsize, the admeasurement of active bees or beholder bees is generated. Anniversary band-aid xi is a D-dimensional agent that represents the cardinal of optimized ambit and produced usingthe blueprint 1:

where,xmaxandxminare the aerial and lower apprenticed of the parameterxi,respectively and j denotes the dimension. The fettle of aliment sources to acquisition the all-around optimal is affected by the afterward formula:

where, fm(xm)is the cold action amount of xm. Then the active bee appearance starts. In this phase, anniversary active bee xi finds a new aliment antecedent viin its adjacency appliance the blueprint 3:

where, t: Aeon number; : About alleged active bee and k is not according to i ; ( ): A alternation of accidental capricious in the ambit [-1, 1]. The fettle of new band-aid produced is compared with that of accepted band-aid and memorizes the bigger one by agency of a acquisitive alternative mechanism.

Employed bees allotment their advice about aliment sources with beholder bees cat-and-mouse in the accumulate and beholder bees probabilistically accept their aliment sources appliance fettle based alternative address such as roulette caster alternative apparent in blueprint 4:

where, Pi: Anticipation of selecting the ith active bee, S: Admeasurement of active bees, θi: Position of the ith active bee and F : Fettle value. Afterthatonlookerbeescarried outrandomly searchintheirneighborhood agnate to active bees and acquire the bigger one.

Employed bees whose solutions can’t be bigger through a agreed cardinal of cycles, alleged limit, become scouts and their solutions are abandoned. Then, they acquisition a new accidental aliment antecedent position appliance the afterward blueprint 5:

Where, r: A accidental cardinal amid 0 and 1 and these accomplish are again through a agreed cardinal of cycles alleged Best Aeon Cardinal (MCN).

3.PROPOSED WORK: VTS-ABC ALGORITHM

In every meta-heuristic algorithm mainly two factors charge to be counterbalanced for all-around access aftereffect i.e. Assay and Corruption but ABC is a poor antithesis of these two factors. Assorted variants of ABC accept been modelled for its advance in altered phases by cardinal of advisers like Sharma and Pant accept proposed a alternative of ABC alleged RABC for analytic the after access botheration [20] and Tsai et al. accept presented an alternate ABC access algorithm to break combinational access botheration [21] in which the abstraction of accepted gravitational force for the movement of beholder bees is alien to enhance the assay adeptness of the ABC algorithm. D. Kumar and B. Kumar additionally advised assorted affidavit on ABC and accord a adapted RABC algorithm based on cartography for access of criterion functions [22] [23].

Intelligence of ABC algorithm mainly depends aloft the advice amid alone agents. Active beesshare their advice with beholder bees cat-and-mouse in the accumulate and breeze of this advice from one alone to addition depends on the alternative apparatus used. Altered alternative schemes baddest altered individuals to allotment the advice which affect the advice adeptness of individuals and primarily the aftereffect of the algorithm. ABC algorithm uses Roulette caster alternative apparatus in which anniversary beholder bee selects the aliment antecedent based on assertive probability. Anniversary beholder bee selects the best aliment antecedent with aerial alternative burden and advance to abortive convergence. To affected this problem, its new alternative is proposed in which Clash Alternative adjustment is activated based on Aeon cardinal and cardinal of active bees.

In Clash selection, a clash admeasurement (TS) is alleged to baddest the cardinal of active bees administration the advice with beholder bees. For bigger exploration, TS=2 i.e. Binary Clash is activated in aboriginal stages and for bigger exploitation, capricious clash admeasurement is activated based on the accepted aeon cardinal (CYL) and admeasurement of active bee in average stages. As the stages grow, this adjustment works agnate to Roulette caster adjustment in the end. Hence, the alternative burden is beneath in aboriginal stages and added in final stages which accommodate us bigger affection of solution. As capricious admeasurement of clash is acclimated at altered stages of the algorithm, appropriately the algorithm alleged VTS-ABC (Variable Clash Admeasurement Bogus Bee Colony) algorithm. Adjustment acclimated for artful TS is apparent in blueprint 6 and blueprint 7:

If SN >= 20

If SN<20

Where

Here, two equations are apparent for artful clash admeasurement of clash alternative method. The purpose of appliance these two equations is to access the acceleration of algorithm. Back the admeasurement of active bee i.e. accustomed citizenry of aliment antecedent positions is baby like 10, a band-aid can be calmly begin by alteration the clash admeasurement by 1 but as the admeasurement grows i.e. back best aliment antecedent position is to be begin in ample set of citizenry for archetype back SN=40 or added than 40, accretion admeasurement of clash by 1 and 2 alone is a actual annoying assignment as it will booty added time to run the algorithm. Hence, in adjustment to access acceleration of algorithm, the clash admeasurement based on accepted aeon and admeasurement of citizenry is increased.

One added abstraction is activated to access its aggregation speed. At anniversary abundance or cycle, a new band-aid is generated about agnate to advance and its fettle amount is calculated. Acquisitive alternative apparatus is activated amid new band-aid and affliction one and the bigger band-aid is memorized. Hence, it helps in award acceptable affection of band-aid as able-bodied as convalescent the aggregation acceleration and provides bigger antithesis amid assay and exploitation.

4.experiments and simulation results

4.1 Criterion Functions

The Criterion Functions acclimated to analyze the achievement of VTS-ABC algorithm with aboriginal ABC algorithm are illustrated below:

  1. Sphere Function:

  1. Schwefel Function:

  1. Griewank Function:

Where

  1. Ackley Function:

Here, ObjVal is the action amount affected for anniversary aliment antecedent position. A aliment antecedent is represented by X and citizenry admeasurement is taken of n*p cast area n is the no. of accessible aliment antecedent positions and p represents the ambit of anniversary position.

4.2 Achievement Measures & Simulation Result

The beginning after-effects of VTS-ABC and ABC algorithm in MATLAB are taken beneath the constant of admeasurement of aliment antecedent positions (n*p) i.e. altered admeasurement of citizenry with altered ambit are taken to run and analyze both algorithms. MCN is set as 2000 and anniversary algorithm is run for 3 abundance i.e. Runtime=3. Absolute for scouts is set equals to 300. In adjustment to accommodate the quantitative appraisal of the achievement of an access algorithm, Beggarly of All-around Minimum i.e. beggarly of minimum cold action amount at anniversary aeon of all iterations are taken as achievement admeasurement whose ethics are apparent in table1and amount 1-4.

Table1: Beggarly of All-around minimum on altered admeasurement of data

Benchmark function

Algorithm

20*10

100*100

150*100

Sphere

ABC

0.340462

13.0503

0.0124608

 

VTS-ABC

0.0988222

6.70776

0.011053

Schwefel

ABC

1.23231

0.107861

19.0437

 

VTS-ABC

0.729075

0.107592

14.3503

Griewank

ABC

0.0619326

0.000526703

0.447714

 

VTS-ABC

0.0146616

0.00043907

0.189238

Ackley

ABC

1.56513

0.0648988

2.57993

 

VTS-ABC

0.946886

0.0604899

2.13692

Fig. 1: Beggarly of Sphere action ethics on altered admeasurement of data

Fig. 2: Beggarly of Schwefel action ethics on altered admeasurement of data

Fig. 3: Beggarly of Griewank action ethics on altered admeasurement of data

Fig. 4: Beggarly of Ackley action ethics on altered admeasurement of data

Figure 1 to 4 appearance simulation after-effects of ABC and VTS-ABC algorithm with altered admeasurement of abstracts on Sphere, Schwefel, Griewank, Ackley appropriately and acknowledge that VTS-ABC algorithm provides us bigger affection of band-aid than aboriginal ABC algorithm by aspersing cold action amount or bearing college fettle solutions.

5. DISCUSSION AND CONCLUSION

In this paper, a new algorithm VTS-ABC is presented. In this algorithm, firstly capricious clash admeasurement (TS) is activated to baddest the aliment antecedent position for beholder bees which helps to accomplish assortment in solution. Then to access aggregation speed, a new band-aid is generated in anniversary aeon which replaced the affliction one. In adjustment to authenticate the achievement of proposed algorithm, it is activated on several Criterion functions with altered admeasurement of abstracts set as input. Simulation after-effects appearance that it provides bigger affection of band-aid than aboriginal ABC algorithm in every case. Therefore, it can be activated in altered fields of access with ample and college ambit abstracts set efficiently.

References

  1. Yugal Kumar and Dharmender Kumar, “Parametric Assay of Attributes Aggressive Access Techniques”International Journal of Computer Applications, vol. 32, no. 3, pp. 42-49, Oct. 2011.
  2. P. J. Angeline, J. B. Pollack and G.M. Saunders, “An evolutionary algorithm that constructs alternate neural networks,” Neural Networks in IEEE Transactions on, vol. 5, no. 1, 1994, pp. 54-65.
  3. J. Kennedy and R. Eberhart, “Particle army optimization,” in Proceedings of IEEE all-embracing appointment on neural networks, 1995, vol. 4, pp. 1942–1948.
  4. E. Bonabeau, M. Dorgio, and G. Theraulaz, “Swarm intelligence: from neural arrangement to bogus intelligence,” NY: cossack university press, New York, 1999.
  5. D. Karaboga, “An abstraction based on honey bee army for after optimization,” Techn.Rep. TR06, Erciyes Univ. Press, Erciyes, 2005.
  6. D. Karaboga and B. Akay, “A allusive abstraction of bogus bee antecedents algorithm,” Applied Mathematics and Computation, vol. 214, no. 1, pp. 108–132, 2009.
  7. R. S. Rao, S. V. L. Narasimham, and M. Ramalingaraju, “Optimization of administration arrangement agreement for accident abridgement appliance bogus bee antecedents algorithm,” International Journal of Electrical Power and Energy Systems Engineering, vol. 1, no.2, pp. 116–122, 2008.
  8. A. Singh, “An bogus bee antecedents algorithm for the leaf-constrained minimum spanning timberline problem,” Applied Soft Computing, vol. 9, no. 2, pp. 625–631, Mar. 2009.
  9. D. Karaboga and B. Basturk, “Artificial bee antecedents (ABC) access algorithm for analytic accountable access problems,” in Foundations of Fuzzy Logic and Soft Computing, Springer, 2007, pp. 789–798.
  10. C. Chidambaram and H. S. Lopes, “A new access for arrangement analogous in agenda images appliance an Bogus Bee Antecedents Algorithm,” in World Congress on Attributes Biologically Aggressive Computing, 2009. NaBIC 2009, IEEE, 2009, pp. 146–151.
  11. N. K. Kaur Mann, “Review Cardboard on Clustering Techniques,” Global Journal of Computer Science and Technology, vol. 13, no. 5, 2013.
  12. S. Okdem, D. Karaboga, and C. Ozturk, “An appliance of Wireless Sensor Arrangement acquisition based on Bogus Bee Antecedents Algorithm,” in 2011 IEEE Congress on Evolutionary Computation (CEC), 2011, pp. 326–330.
  13. T. K. Sharma, M. Pant, and J. C. Bansal, “Some modifications to enhance the achievement of Bogus Bee Colony,” in 2012 IEEE Congress on Evolutionary Computation (CEC), 2012, pp. 1–8.
  14. L. Bao and J. Zeng, “Comparison and assay of the alternative apparatus in the bogus bee antecedents algorithm,” in Hybrid Able Systems, 2009. HIS’09. Ninth All-embracing Appointment on, 2009, vol. 1, pp. 411–41.
  15. C. M. V. Benítez and H. S. Lopes, “Parallel Bogus Bee Antecedents Algorithm Approaches for Protein Structure Prediction Appliance the 3DHP-SC Model,” in Intelligent Broadcast Computing IV, M. Essaaidi, M. Malgeri, and C. Badica, Eds. Springer Berlin Heidelberg, 2010, pp. 255–264.
  16. D. L. González-Álvarez, M. A. Vega-Rodríguez, J. A. Gómez-Pulido, and J. M. Sánchez-Pérez, “Finding Motifs in DNA Sequences Applying a Multiobjective Bogus Bee Antecedents (MOABC) Algorithm,” in Evolutionary Computation, Apparatus Learning and Abstracts Mining in Bioinformatics, C. Pizzuti, M. D. Ritchie, and M. Giacobini, Eds. Springer Berlin Heidelberg, 2011, pp. 89–100.
  1. L. Wang, G. Zhou, Y. Xu, S. Wang, and M. Liu, “An able bogus bee antecedents algorithm for the adjustable job-shop scheduling problem,” Int J Adv Manuf Technol, vol. 60, no. 1–4, pp. 303–315, Apr. 2012.
  2. S.-W. Lin and K.-C. Ying, “Increasing the absolute net acquirement for distinct apparatus adjustment accepting and scheduling problems appliance an bogus bee antecedents algorithm,” J Oper Res Soc, vol. 64, no. 2, pp. 293–311, Feb. 2013.
  3. D. Karaboga, “An abstraction based on honey bee army for after optimization,” Techn.Rep. TR06, Erciyes Univ. Press, Erciyes, 2005.
  4. T. K. Sharma, M. Pant, and J. C. Bansal, “Some modifications to enhance the achievement of Bogus Bee Colony,” in 2012 IEEE Congress on Evolutionary Computation (CEC), 2012, pp. 1–8.
  5. TSai, Pei-Wei, et al. , “Enhanced bogus bee antecedents optimization.”International Journal of Innovative Computing, Advice and Control,vol. 5, no. 12, 2009, pp.5081-5092.
  6. B. K. Verma and D. Kumar, “A analysis on Bogus Bee Antecedents algorithm,” International Journal of Engineering & Technology, vol. 2, no. 3, pp. 175–186, 2013.
  7. D. Kumar and B. Kumar, “Optimization of Criterion Functions Appliance Bogus Bee Antecedents (ABC) Algorithm,” IOSR Journal of Engineering, vol. 3, no. 10, pp. 09-14, October 2013.

Order a unique copy of this paper

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
Top Academic Writers Ready to Help
with Your Research Proposal
Live Chat+1(978) 822-0999EmailWhatsApp

Order your essay today and save 20% with the discount code COURSEGUY