Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An Adaptive Bumble Bees Mating Optimization algorithm
Technical University of Crete, School of Production Engineering and Management, University Campus, 73100 Chania.
Technical University of Crete, School of Production Engineering and Management, University Campus, 73100 Chania.
Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
Number of Authors: 3
2017 (English)In: Applied Soft Computing, ISSN 1568-4946, E-ISSN 1872-9681, Vol. 56, 13-30 p.Article in journal (Refereed) Published
Abstract [en]

The finding of the suitable parameters of an evolutionary algorithm, as the Bumble Bees Mating Optimization (BBMO) algorithm, is one of the most challenging tasks that a researcher has to deal with. One of the most common used ways to solve the problem is the trial and error procedure. In the recent few years, a number of adaptive versions of every evolutionary and nature inspired algorithm have been presented in order to avoid the use of a predefined set of parameters for all instances of the studied problem. In this paper1, an adaptive version of the BBMO algorithm is proposed, where initially random values are given to each one of the parameters and, then, these parameters are adapted during the optimization process. The proposed Adaptive BBMO algorithm is used for the solution of the Multicast Routing Problem (MRP). As we would like to prove that the proposed algorithm is suitable for solving different kinds of combinatorial optimization problems we test the algorithm, also, in the Probabilistic Traveling Salesman Problem (PTSP) and in the Hierarchical Permutation Flowshop Scheduling Problem (HPFSP). Finally, the algorithm is tested in four classic benchmark functions for global optimization problems (Rosenbrock, Sphere, Rastrigin and Griewank) in order to prove the generality of the procedure. A number of benchmark instances for all problems are tested using the proposed algorithm in order to prove its effectiveness.

Place, publisher, year, edition, pages
2017. Vol. 56, 13-30 p.
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
URN: urn:nbn:se:ltu:diva-61742DOI: 10.1016/j.asoc.2017.01.032ScopusID: 2-s2.0-85012284307OAI: oai:DiVA.org:ltu-61742DiVA: diva2:1070164
Note

Validerad; 2017; Nivå 2; 2017-02-23 (andbra)

Available from: 2017-01-31 Created: 2017-01-31 Last updated: 2017-02-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Migdalas, Athanasios
By organisation
Business Administration and Industrial Engineering
In the same journal
Applied Soft Computing
Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 36 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf