<![CDATA[WUJ]]><![CDATA[info@ejournals.eu]]>https://www.ejournals.eu/20200925ejournals.eu.article.359403010610.4467/2353737XCT.14.056.396420<![CDATA[knapsack problem, ant colony optimisation, heuristic algorithm]]>00ED031001Number10102<![CDATA[Czasopismo Techniczne]]>03<![CDATA[2013]]>01<![CDATA[Automatyka Zeszyt 3-AC (11) 2013]]>1A01<![CDATA[Krzysztof Schiff]]>0101<![CDATA[Ant colony optimization algorithm for the 0-1 knapsack problem]]>01en001303020PLN03<![CDATA[This article describes a new ant colony optimisation algorithm for the discrete knapsack problem with a new heuristic pattern, based on the ratio of the square of the profit coefficient to the square of the weight coefficient of the original problem. This new heuristic is used in order to choose objects that should be packed into the knapsack. This pattern was compared with two used in ant algorithms and which have been presented in the literature on the subject of ant colony optimisation algorithms for the 0-1 Knapsack Problem. The two other patterns are based on the ratio of the profit coefficient to the weight coefficient multiplied respectively by the total and the current knapsack load capacity. Results of tests under a width range of ant algorithm parameters such as the number of cycles, the number of ants, the evaporation rate, and the load knapsack capacity are shown and discussed.]]>012014091615000401http://dx.doi.org/10.4467/2353737XCT.14.056.3964