0-1 Çok Boyutlu Sırt Çantası Probleminin Feromonal Yapay Arı Koloni (fYAK) Algoritması ile Çözümü

Optimizasyon algoritmaları, geliştirilme tarzları itibariyle bazı problemlere daha çok odaklanarak, daha başarılı çözümler üretebilmektedirler. Örneğin sayısal çözüm yaklaşımıyla üretilen yapay arı koloni (YAK) algoritması, nümerik optimizasyon problemlerinde daha başarılı sonuçlara ulaşabilirken, karınca koloni optimizasyonu (KKO), gezgin satıcı problemi (GSP) benzeri ayrık yapılı optimizasyon problemlerinde daha başarılı çözümler üretebilir. 0-1 optimizasyon problemleri, ayrık yapılı problemlerdir. Ancak çözüm elemanları itibariyle optimizasyon problemlerinin üçüncü grubu olarak değerlendirilebilir. Bu çalışmada 0-1 çok boyutlu sırt çantası problemleri için YAK ve KKO algoritmalarının melez versiyonu olarak geliştirilen fYAK algoritması önerilmiştir. Algoritma performansı, popüler test problemleri üzerinde denenmiş ve elde edilen sonuçlar YAK ve KKO sonuçlarıyla karşılaştırılmıştır.

The Solution of 0-1 Multidimensional Knapsack Problem with Pheromonal Artificial Bee Colony (pABC) Algorithm

Optimization algorithms can produce more successful solutions by focusing more on some problems in terms of their development style. For example, the artificial bee colony (ABC) algorithm produced by the numerical solution approach can achieve more successful results in numerical optimization problems, whereas ant colony optimization (ACO) can produce more successful solutions in discrete structure problems such as traveling salesman problem (TSP). 0-1 optimization problems are discrete structured problems. However, it can be considered as the third group of optimization problems in terms of solution items. In this study, the pABC algorithm developed as a hybrid version of ABC and ACO algorithms for 0-1 multidimensional knapsack problems was proposed. The performance of pABC was tested on popular benchmark problems, and the results obtained by the algorithm were compared with the results of ABC and ACO.

PDF

___

[1] S. I. Gass and A. A. Assad, An Annotated Timeline of Operations Research. Boston: Kluwer Academic Publishers, 2004.
[2] J.-W. Lee, D.-H. Lee, and J.-J. Lee, “Global path planning using improved ant colony optimization algorithm through bilateral cooperative exploration,” in 5th IEEE International Conference on Digital Ecosystems and Technologies (IEEE DEST 2011), 2011, vol. 5, no. June, pp. 109–113.
[3] A. Aljanaby, K. R. Ku Mahamud, and N. Norwawi, “Interacted Multiple Ant Colonies Optimization Framework: an Experimental Study of the Evaluation and the Exploration Techniques to Control the Search Stagnation,” Int. J. Adv. Comput. Technol., vol. 2, no. 1, pp. 78–85, Mar. 2010.
[4] M. Ehrgott and X. Gandibleux, “A survey and annotated bibliography of multiobjective combinatorial optimization,” OR-Spektrum, vol. 22, no. 4, pp. 425–460, 2000.
[5] P. C. Chu and J. E. Beasley, “A Genetic Algorithm for the Multidimensional Knapsack Problem,” J. Heuristics, vol. 4, pp. 63–86, 1998.
[6] R. Parra-Hernandez and N. J. Dimopoulos, “A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem,” IEEE Trans. Syst. Man, Cybern. - Part A Syst. Humans, vol. 35, no. 5, pp. 708–717, Sep. 2005.
[7] A. Sbihi, “A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem,” J. Comb. Optim., vol. 13, no. 4, pp. 337–351, Apr. 2007.
[8] M. E. Captivo, J. Climaco, J. Figueira, E. Martins, and J. L. Santos, “Solving bicriteria 0 – 1 knapsack problems using a labeling algorithm,” Comput. Oper. Res., vol. 30, pp. 1865–1886, 2003.
[9] M. Laumanns, L. Thiele, and E. Zitzler, “An efficient , adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method,” Eur. J. Oper. Res., vol. 169, pp. 932–942, 2006.
[10] L. Ke, Z. Feng, Z. Ren, and X. Wei, “An ant colony optimization approach for the multidimensional knapsack problem,” J. Heuristics, vol. 16, no. 1, pp. 65–83, Feb. 2010.
[11] M. Kong, P. Tian, and Y. Kao, “A new ant colony optimization algorithm for the multidimensional Knapsack problem,” Comput. Oper. Res., vol. 35, no. 8, pp. 2672– 2683, Aug. 2008.
[12] S. Hanafi and C. Wilbaut, “Scatter Search for the 0–1 Multidimensional Knapsack Problem,” J. Math. Model. Algorithms, vol. 7, no. 2, pp. 143–159, Jun. 2008.
[13] L. Wang, X. Zheng, and S. Wang, “KnowledgeBased Systems A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem,” Knowledge-Based Syst., vol. 48, pp. 17–23, 2013.
[14] V. Tongur and E. Ülker, “Migrating Birds Optimization (MBO) algorithm to solve 0-1 multidimensional knapsack problem,” in 2017 International Conference on Computer Science and Engineering (UBMK), 2017, pp. 786–789.
[15] K. Klamroth and M. M. Wiecek, “Dynamic Programming Approaches to the Multiple Criteria Knapsack Problem,” Nav. Res. Logist., vol. 47, pp. 57–76, 2000.
[16] Ö. Karsu, “Eşitlikçi Çok Amaçlı Sırt Çantası Problemi,” Gazi ÜniversitesiFen Bilim. Derg., vol. 6, no. 2, pp. 358–373, 2018.
[17] D. Karaboga, B. Gorkemli, and C. Ozturk, “A comprehensive survey: artificial bee colony (ABC) algorithm and applications,” Artif. Intell. Rev., vol. 42, no. 1, pp. 21–57, 2014.
[18] S. Neelima, N. Satyanarayana, and P. K. Murthy, “A Comprehensive Survey on Variants in Artificial Bee Colony (ABC),” Int. J. Comput. Sci. Inf. Technol., vol. 7, no. 4, pp. 1684–1689, 2016.
[19] B. Akay and D. Karaboga, “A survey on the applications of artificial bee colony in signal, image, and video processing,” Signal, Image Video Process., vol. 9, no. 4, pp. 967–990, 2015.
[20] W. Gong, “ABC-ACO for Perishable Food Vehicle Routing Problem with Time Windows,” 2010 Int. Conf. Comput. Inf. Sci., pp. 1261–1264, 2010.
[21] M. Kefayat, A. Lashkar Ara, and S. A. Nabavi Niaki, “A hybrid of ant colony optimization and artificial bee colony algorithm for probabilistic optimal placement and sizing of distributed energy resources,” Energy Convers. Manag., vol. 92, pp. 149–161, Mar. 2015.
[22] P. Shunmugapriya and S. Kanmani, “A hybrid algorithm using ant and bee colony optimization for feature selection and classification (AC-ABC Hybrid),” Swarm Evol. Comput., vol. 36, pp. 27–36, Oct. 2017.
[23] H. Wei, J. Ji, Y. Qin, Y. Wang, and C. Liu, “A Novel Artificial Bee Colony Algorithm Based on Attraction Pheromone for the Multidimensional Knapsack Problems,” in Artificial Intelligence and Computational Intelligence, no. 1, H. Deng, D. Miao, J. Lei, and F. L. Wang, Eds. Springer Berlin Heidelberg, 2011, pp. 1–10.
[24] J. Ji, H. Wei, C. Liu, and B. Yin, “Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem,” Math. Probl. Eng., vol. 2013, pp. 1– 13, 2013.
[25] D. Ekmekci, “A Pheromonal Artificial Bee Colony -pABC-Algorithm for Optimization Problems,” in 2019 16th International Multi-Conference on Systems, Signals & Devices (SSD), 2019, no. M, pp. 452–456.
[26] D. Ekmekci, “A Pheromonal Artificial Bee Colony (pABC) Algorithm for Discrete Optimization Problems,” Appl. Artif. Intell., vol. 33, no. 11, pp. 935–950, Sep. 2019.
[27] D. Karaboga, “An Idea Based on Honey Bee Swarm for Numerical Optimization,” Kayseri, Turkey, 2005.
[28] M. Dorigo, V. Maniezzo, and A. Colorni, “Positive feedback as a search strategy,” Milano, Italy, 1991.
[29] M. Dorigo and C. Blum, “Ant colony optimization theory: A survey,” Theor. Comput. Sci., vol. 344, no. 2–3, pp. 243–278, Nov. 2005.
[30] M. Abdel-Basset, D. El-Shahat, H. Faris, and S. Mirjalili, “A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems,” Comput. Ind. Eng., vol. 132, no. September 2018, pp. 187–206, Jun. 2019.
[31] X. Lai, J.-K. Hao, F. Glover, and Z. Lü, “A twophase tabu-evolutionary algorithm for the 0–1 multidimensional knapsack problem,” Inf. Sci. (Ny)., vol. 436–437, pp. 282–301, Apr. 2018.