Skip to main content
Top
Published in: International Journal of Machine Learning and Cybernetics 5/2014

01-10-2014 | Original Article

An improved artificial bee colony algorithm for minimal time cost reduction

Authors: Jinling Cai, William Zhu, Haijun Ding, Fan Min

Published in: International Journal of Machine Learning and Cybernetics | Issue 5/2014

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The artificial bee colony (ABC) is a popular heuristic optimization algorithm. Although it has fewer control parameters, it shows competitive performance compared with other population-based algorithms. The ABC algorithm is good at exploration, but poor at exploitation. Recently, a global best-guided ABC (GABC) algorithm, inspired by particle swarm optimization, has been developed to tackle this issue. However, GABC cannot be applied to binary optimization problems. In this paper, we develop an improved ABC (IABC) algorithm with a new food source update strategy. IABC employs information about the global best solution as well as personal best solutions, thus enhancing the local search abilities of the bees. The new algorithm is adjusted to solve the binary optimization problem of minimal time cost reduction. We conduct a series of experiments on four UCI datasets, and our results clearly indicate that our algorithm outperforms the existing ABC algorithms, especially on the medium-sized Mushroom dataset.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Show more products
Literature
2.
go back to reference Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci 180(17):3182–3191MathSciNetCrossRef Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci 180(17):3182–3191MathSciNetCrossRef
3.
go back to reference Karaboga D, Akay B, Ozturk C (2007) Artificial bee colony (ABC) optimization algorithm for training feed-forward neural networks. Model Decisions Artif Intell 4617:318–329CrossRef Karaboga D, Akay B, Ozturk C (2007) Artificial bee colony (ABC) optimization algorithm for training feed-forward neural networks. Model Decisions Artif Intell 4617:318–329CrossRef
4.
go back to reference Karaboga N (2009) A new design method based on artificial bee colony algorithm for digital IIR filters. J Franklin Inst 346(4):328–348MATHMathSciNetCrossRef Karaboga N (2009) A new design method based on artificial bee colony algorithm for digital IIR filters. J Franklin Inst 346(4):328–348MATHMathSciNetCrossRef
5.
go back to reference Linh NT, Anh NQ (2010) Application artificial bee colony algorithm (ABC) for reconfiguring distribution network. In: Second International Conference on Computer modeling and simulation. ICCMS’10, Vol. 1, IEEE. 2010. pp 102–106 Linh NT, Anh NQ (2010) Application artificial bee colony algorithm (ABC) for reconfiguring distribution network. In: Second International Conference on Computer modeling and simulation. ICCMS’10, Vol. 1, IEEE. 2010. pp 102–106
6.
go back to reference Chang WL, Zeng D, Chen RC, Guo S (2013) An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks. Int J Machine Learn Cybern 4:1–9 Chang WL, Zeng D, Chen RC, Guo S (2013) An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks. Int J Machine Learn Cybern 4:1–9
7.
go back to reference Rajasekhar A, Abraham A, Pant M (2011) A hybrid differential artificial bee colony algorithm based tuning of fractional order controller for permanent magnet synchronous motor drive. Int J Mach Learn Cybern 4:1–11 Rajasekhar A, Abraham A, Pant M (2011) A hybrid differential artificial bee colony algorithm based tuning of fractional order controller for permanent magnet synchronous motor drive. Int J Mach Learn Cybern 4:1–11
8.
go back to reference Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surveys (CSUR) 35(3):268–308CrossRef Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surveys (CSUR) 35(3):268–308CrossRef
9.
go back to reference Zhu GP, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166–3173MATHMathSciNetCrossRef Zhu GP, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166–3173MATHMathSciNetCrossRef
10.
go back to reference Rana S, Jasola S, Kumar R (2012) A boundary restricted adaptive particle swarm optimization for data clustering. Int J Mach Learn Cybern 4:1–10 Rana S, Jasola S, Kumar R (2012) A boundary restricted adaptive particle swarm optimization for data clustering. Int J Mach Learn Cybern 4:1–10
11.
go back to reference Wang XZ, He YL, Dong LC, Zhao HY (2011) Particle swarm optimization for determining fuzzy measures from data. Inf Sci 181(19):4230–4252MATHCrossRef Wang XZ, He YL, Dong LC, Zhao HY (2011) Particle swarm optimization for determining fuzzy measures from data. Inf Sci 181(19):4230–4252MATHCrossRef
12.
go back to reference Kıran MMS (2013) Xor-based artificial bee colony for binary optimization. Turkish J Electrical Eng Comput Sci 21:2307–2328CrossRef Kıran MMS (2013) Xor-based artificial bee colony for binary optimization. Turkish J Electrical Eng Comput Sci 21:2307–2328CrossRef
13.
go back to reference Kashan MH, Nahavandi N, Kashan AH (2012) Disabc: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342–352CrossRef Kashan MH, Nahavandi N, Kashan AH (2012) Disabc: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342–352CrossRef
14.
go back to reference Cai JL, Ding HJ, Zhu W, Zhu XZ (2013) Artificial bee colony algorithm to minimal time cost reduction. J Comput Inf Systems 9 (21):8725–8734 Cai JL, Ding HJ, Zhu W, Zhu XZ (2013) Artificial bee colony algorithm to minimal time cost reduction. J Comput Inf Systems 9 (21):8725–8734
15.
go back to reference Min F, He HP, Qian YH, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181:4928–4942CrossRef Min F, He HP, Qian YH, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181:4928–4942CrossRef
16.
go back to reference Zhang S (2010) Cost-sensitive classification with respect to waiting cost. Knowl Based Systems 23(5):369–378CrossRef Zhang S (2010) Cost-sensitive classification with respect to waiting cost. Knowl Based Systems 23(5):369–378CrossRef
17.
18.
go back to reference Cromwell DA (2004) Waiting time information services: an evaluation of how well clearance time statistics can forecast a patient’s wait. Soc Sci Med 59(9):1937–1948CrossRef Cromwell DA (2004) Waiting time information services: an evaluation of how well clearance time statistics can forecast a patient’s wait. Soc Sci Med 59(9):1937–1948CrossRef
19.
go back to reference Ji S, Carin L (2007) Cost-sensitive feature acquisition and classification. Pattern Recognit 40(5):1474–1485MATHCrossRef Ji S, Carin L (2007) Cost-sensitive feature acquisition and classification. Pattern Recognit 40(5):1474–1485MATHCrossRef
20.
go back to reference Sheng VS, Ling CX (2006) Feature value acquisition in testing: a sequential batch test algorithm. In: Proceedings of the 23rd International Conference on Machine Learning, ACM 809–816 Sheng VS, Ling CX (2006) Feature value acquisition in testing: a sequential batch test algorithm. In: Proceedings of the 23rd International Conference on Machine Learning, ACM 809–816
25.
go back to reference Zhang W, Mi J, Wu W (2003) Knowledge reductions in inconsistent information systems. Chin J Comput 26(1):12–18MathSciNet Zhang W, Mi J, Wu W (2003) Knowledge reductions in inconsistent information systems. Chin J Comput 26(1):12–18MathSciNet
26.
go back to reference Jensen R, Shen Q (2004) Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Transact Knowl Data Eng 16(12):1457–1471CrossRef Jensen R, Shen Q (2004) Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Transact Knowl Data Eng 16(12):1457–1471CrossRef
28.
go back to reference Zhu W (2009) Relationship among basic concepts in covering-based rough sets. Inf Sci 179(14):2478–2486MATHCrossRef Zhu W (2009) Relationship among basic concepts in covering-based rough sets. Inf Sci 179(14):2478–2486MATHCrossRef
29.
go back to reference Zhu W, Wang F (2003) Reduction and axiomization of covering generalized rough sets. Inf Sci 152(1):217–230MATHCrossRef Zhu W, Wang F (2003) Reduction and axiomization of covering generalized rough sets. Inf Sci 152(1):217–230MATHCrossRef
30.
go back to reference Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techn. Rep. TR06, Erciyes Univ. Press, Erciyes Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techn. Rep. TR06, Erciyes Univ. Press, Erciyes
31.
go back to reference Bae C, Yeh WC, Chung YY, Liu SL (2010) Feature selection with intelligent dynamic swarm and rough set. Expert Systems Appl 37(10):7026–7032CrossRef Bae C, Yeh WC, Chung YY, Liu SL (2010) Feature selection with intelligent dynamic swarm and rough set. Expert Systems Appl 37(10):7026–7032CrossRef
32.
go back to reference Song MP, Gu GC (2004) Research on particle swarm optimization: a review, In: Machine learning and cybernetics. Proceedings of 2004 International Conference on, Vol. 4, IEEE, 2004, 2236–2241 Song MP, Gu GC (2004) Research on particle swarm optimization: a review, In: Machine learning and cybernetics. Proceedings of 2004 International Conference on, Vol. 4, IEEE, 2004, 2236–2241
Metadata
Title
An improved artificial bee colony algorithm for minimal time cost reduction
Authors
Jinling Cai
William Zhu
Haijun Ding
Fan Min
Publication date
01-10-2014
Publisher
Springer Berlin Heidelberg
Published in
International Journal of Machine Learning and Cybernetics / Issue 5/2014
Print ISSN: 1868-8071
Electronic ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-013-0219-8

Other articles of this Issue 5/2014

International Journal of Machine Learning and Cybernetics 5/2014 Go to the issue