research-article

Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem

Authors:

Teddy Nurcahyadi,

Christian BlumAuthors Info & Claims

ISMSI '21: Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence

Pages 22 - 27

https://doi.org/10.1145/3461598.3461602

Published: 10 August 2021 Publication History

Abstract

In this paper we continue our recent work on the development of a negative learning component for ant colony optimization, which is a metaheuristic algorithm that is mostly based on positive learning, that is, on learning from positive examples. In particular, we apply our approach to the well-known multi dimensional knapsack problem as a test case. The obtained results show that our negative learning approach significantly outperforms the standard ant colony optimization approach.

References

[1]

Christian Blum and Marco Dorigo. 2004. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 34, 2(2004), 1161–1172.

Digital Library

[2]

Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, and Philippe Michelon. 2010. A multi-level search strategy for the 0–1 multidimensional knapsack problem. Discrete Applied Mathematics 158, 2 (2010), 97–109.

Digital Library

[3]

Bernd Bullnheimer, Richard R. Hartl, and Christine Strauss. 1999. A new rank-based version of the Ant System: a computational study. Central European Journal of Operations Research 7, 1 (1999), 25–38.

[4]

B. Calvo and G. Santafé. 2016. scmamp: Statistical Comparison of Multiple Algorithms in Multiple Problems. The R Journal 8, 1 (2016).

[5]

Paul C. Chu and John E. Beasley. 1994. A genetic algorithm for the multidimensional knapsack problem. Discrete Applied Mathematics 49, 1 (1994), 189–212.

[6]

O. Cordón, I. Fernández de Viana, F. Herrera, and L. Moreno. 2000. A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System. In Proceedings of ANTS 2000 – Second International Workshop on Ant Algorithms. 22–29.

[7]

Marco Dorigo and Luca Maria Gambardella. 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on evolutionary computation 1, 1(1997), 53–66.

Digital Library

[8]

Marco Dorigo and Thomas Stützle. 2004. Ant Colony Optimization. MIT Press.

[9]

Marco Dorigo and Thomas Stützle. 2019. Ant colony optimization: overview and recent advances. In Handbook of metaheuristics. Springer, 311–351.

[10]

Orhan Engin and Abdullah Güçlü. 2018. A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Applied Soft Computing 72 (2018), 166–176.

[11]

S. García and F. Herrera. 2008. An Extension on “Statistical Comparisons of Classifiers over Multiple Data Sets” for all Pairwise Comparisons. Journal of Machine Learning Research 9 (2008), 2677 – 2694.

[12]

M Giurfa. 1993. The repellent scent-mark of the honeybeeApis mellifera tigustica and its role as communication cue during foraging. Insectes Sociaux 40, 1 (1993), 59–67.

[13]

Christoph Grüter, Roger Schürch, Tomer J. Czaczkes, Keeley Taylor, Thomas Durance, Sam M. Jones, and Francis L. W. Ratnieks. 2012. Negative Feedback Enables Fast and Flexible Collective Decision-Making in Ants. PLOS ONE 7, 9 (2012), 1–11.

[14]

Steffen Iredi, Daniel Merkle, and Martin Middendorf. 2001. Bi-criterion optimization with multi colony ant algorithms. In Proceedings of EMO 2001 – International Conference on Evolutionary Multi-Criterion Optimization(Lecture Notes in Computer Science, Vol. 1993), E. Zitzler, K. Deb, L. Thiele, C. A. Coello Coello, and D. Corne (Eds.). Springer Berlin Heidelberg, 359–372.

[15]

Raka Jovanovic, Milan Tuba, and Stefan Voß. 2019. An efficient ant colony optimization algorithm for the blocks relocation problem. European Journal of Operational Research 274, 1 (2019), 78–90.

[16]

Xiangyong Kong, Liqun Gao, Haibin Ouyang, and Steven Li. 2015. Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm. Computers & Operations Research 63 (2015), 7–22.

Digital Library

[17]

Xiangjing Lai, Jin-Kao Hao, Zhang-Hua Fu, and Dong Yue. 2020. Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Expert Systems with Applications 149 (2020). Article number 113310.

[18]

Xiangjing Lai, Jin-Kao Hao, Fred Glover, and Zhipeng Lü. 2018. A two-phase tabu-evolutionary algorithm for the 0–1 multidimensional knapsack problem. Information Sciences 436(2018), 282–301.

[19]

Manuel López-Ibánez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, and Thomas Stützle. 2016. The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives 3 (2016), 43 – 58.

[20]

Alice R. Malisia and Hamid R. Tizhoosh. 2007. Applying opposition-based ideas to the ant colony system. In 2007 IEEE Swarm Intelligence Symposium. IEEE press, 182–189.

[21]

Vittorio Maniezzo. 1999. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing 11, 4 (1999), 358–369.

[22]

Renata Mansini and M Grazia Speranza. 2012. Coral: An exact algorithm for the multidimensional knapsack problem. INFORMS Journal on Computing 24, 3 (2012), 399–415.

Digital Library

[23]

James Montgomery and Marcus Randall. 2002. Anti-pheromone as a Tool for Better Exploration of Search Space. In ANTS 2002 – 3rd International Workshop on Ant Algorithms(Lecture Notes in Computer Science, Vol. 2463), Marco Dorigo, Gianni Di Caro, and Michael Sampels (Eds.). Springer Berlin Heidelberg, 100–110.

[24]

Teddy Nurcahyadi and Christian Blum. 2020. A New Approach for Making Use of Negative Learning in Ant Colony Optimization. In ANTS 2020 – 12th International Conference on Swarm Intelligence(Lecture Notes in Computer Science, Vol. 12421), Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich, and Volker Strobel (Eds.). Springer International Publishing, 16–28.

[25]

Huijun Peng, Chun Ying, Shuhua Tan, Bing Hu, and Zhixin Sun. 2018. An improved feature selection algorithm based on ant colony optimization. IEEE Access 6(2018), 69203–69209.

[26]

Elva J. H. Robinson, Duncan E. Jackson, Mike Holcombe, and Francis L. W. Ratnieks. 2005. 'No entry ' signal in ant foraging. Nature 438, 7067 (2005), 442–442.

[27]

Elva J. H. Robinson, Duncan E. Jackson, Mike Holcombe, and Francis L. W. Ratnieks. 2007. No entry signal in ant foraging (Hymenoptera: Formicidae): new insights from an agent-based model. Myrmecological News 10(2007).

[28]

Nicolás Rojas-Morales, María-Cristina Riff, Carlos A. Coello Coello, and Elizabeth Montero. 2018. A Cooperative Opposite-Inspired Learning Strategy for Ant-Based Algorithms. In ANTS 2018 – 11th International Conference on Swarm Intelligence(Lecture Notes in Computer Science, Vol. 11172), Marco Dorigo, Mauro Birattari, Christian Blum, Anders L. Christensen, Andreagiovanni Reina, and Vito Trianni (Eds.). Springer International Publishing, Cham, 317–324.

[29]

Y. Schlein, R. Galun, and M. N. Ben-Eliahu. 1981. Abstinons – Male-produced Deterrents of Mating in Flies. Journal of Chemical Ecology 7, 2 (1981), 285–290.

[30]

R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz. 1997. Ant-Based Load Balancing in Telecommunications Networks. Adaptive Behavior 5, 2 (1997), 169–207.

Digital Library

[31]

Chris Simons and Jim Smith. 2016. Exploiting antipheromone in ant colony optimisation for interactive search-based software design and refactoring. In Proceedings of GECCO 2016 – Genetic and Evolutionary Computation Conference Companion. ACM, 143–144.

Digital Library

[32]

Thomas Stützle and Holger H Hoos. 2000. MAX–MIN ant system. Future generation computer systems 16, 8 (2000), 889–914.

Digital Library

[33]

Erfan Babaee Tirkolaee, Mehdi Alinaghian, Ali Asghar Rahmani Hosseinabadi, Mani Bakhshi Sasi, and Arun Kumar Sangaiah. 2019. An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem. Computers & Electrical Engineering 77 (2019), 457–470.

Digital Library

[34]

Yannick Vimont, Sylvain Boussier, and Michel Vasquez. 2008. Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. Journal of Combinatorial Optimization 15, 2 (2008), 165–178.

[35]

L. Wang, S.-Y. Wang, and Y. Xu. 2012. An effective hybrid EDA-based algorithm for solving multidiemnsional knapsack problems. Expert Systems with Applications 39, 5 (2012), 5593.

Digital Library

Cited By

Xu JLi HYin M(2024)Finding and exploring promising search space for The 0–1 Multidimensional Knapsack ProblemApplied Soft Computing10.1016/j.asoc.2024.111934164(111934)Online publication date: Oct-2024
https://doi.org/10.1016/j.asoc.2024.111934
Nurcahyadi TBlum CManyà F(2022)Negative Learning Ant Colony Optimization for MaxSATInternational Journal of Computational Intelligence Systems10.1007/s44196-022-00120-615:1Online publication date: 29-Aug-2022
https://doi.org/10.1007/s44196-022-00120-6

Recommendations

Negative learning ant colony optimization for the minimum positive influence dominating set problem
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion

Recent research has shown that adding negative learning to ant colony optimization, in addition to the traditional positive learning mechanism, may improve the algorithms' performance significantly. In this paper we consider the application of this ...
Application of Negative Learning Ant Colony Optimization to the Far from Most String Problem
Evolutionary Computation in Combinatorial Optimization
Abstract
We propose the application of a recently introduced version of ant colony optimization—negative learning ant colony optimization—to the far from most string problem. This problem is a notoriously difficult combinatorial optimization problem from ...
Negative learning Ant colony optimization for network alignment
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference

The Network Alignment problem is a hard Combinatorial Optimization problem with a wide range of applications, especially in computational biology. Given two (or more) networks, the goal is to find a mapping between their respective nodes that preserves ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ISMSI '21: Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence

April 2021

87 pages

ISBN:9781450389679

DOI:10.1145/3461598

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Ministerio de Ciencia, Innovación y Universidades

Conference

ISMSI 2021

ISMSI 2021: 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence

April 10 - 11, 2021

Victoria, Seychelles

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
58
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Xu JLi HYin M(2024)Finding and exploring promising search space for The 0–1 Multidimensional Knapsack ProblemApplied Soft Computing10.1016/j.asoc.2024.111934164(111934)Online publication date: Oct-2024
https://doi.org/10.1016/j.asoc.2024.111934
Nurcahyadi TBlum CManyà F(2022)Negative Learning Ant Colony Optimization for MaxSATInternational Journal of Computational Intelligence Systems10.1007/s44196-022-00120-615:1Online publication date: 29-Aug-2022
https://doi.org/10.1007/s44196-022-00120-6

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Table of Contents