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:38, 21 October 2016 (Short description of HUMANT algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

HUMANT (HUManoid ANT) algorithm 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)[1].

  1. ^ 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=745492192"