Ant algorithm for AP-N aimed at optimization of complex systems

DOI10.7494/DMMS.2010.4.2.29MaRDI QIDQ2902358zbMATH OpenOpenAlexWikidataFDO

Authors Jerzy Mikulik, Mirosław Zajdel

Publication date 19 August 2012

Published in Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/dmms.2010.4.2.29

zbMATH Keywords

ant algorithmassignment problemoptimization

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimization of the quadratic assignment problem using an ant colony algorithm
• scientific article; zbMATH DE number 1900792
• Local search heuristics for the multidimensional assignment problem
• Ant algorithms: theory and applications
• Local search heuristics for the multidimensional assignment problem

Cited in

(4)

• A new rank based version of the ant system. -- A computational study
• scientific article; zbMATH DE number 5846258 (Why is no real title available?)
• Problem Solving and Complex Systems
• scientific article; zbMATH DE number 5560333 (Why is no real title available?)

This page was built for publication: Ant algorithm for AP-N aimed at optimization of complex systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902358)