Jump to content

Humanoid ant algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Unist1984 (talk | contribs) at 12:40, 21 October 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

HUMANT (HUManoid ANT) algorithm[1] belongs to Ant colony optimization algorithms. It is a fully operational MOACO with a priori approach to MOO, based on MMAS and multi-criteria decision-making PROMETHEE method. It has been experimentally tested on the Traveling salesman problem and applied to the Partner selection problem (PSP) with up to four objectives (criteria)[2].

  1. ^ Mladineo, Marko; Veza, Ivica; Gjeldum, Nikola (2015). "Single-Objective and Multi-Objective Optimization using the HUMANT algorithm". Croatian Operational Research Review (CRORR). 6. doi:10.17535/crorr.2015.0035.
  2. ^ Mladineo, Marko; Veza, Ivica; Gjeldum, Nikola (16 September 2016). "Solving partner selection problem in cyber-physical production networks using the HUMANT algorithm". International Journal of Production Research: 1–16. doi:10.1080/00207543.2016.1234084.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Humanoid_ant_algorithm&oldid=745492501"