pith. sign in

arxiv: 1208.5340 · v1 · pith:K2HBB2MSnew · submitted 2012-08-27 · 💻 cs.AI · cs.NE

New results of ant algorithms for the Linear Ordering Problem

classification 💻 cs.AI cs.NE
keywords algorithmslinearorderingproblemproblemsresultsant-basedcolony
0
0 comments X
read the original abstract

Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instances, using Ant Colony System (ACS) and the Step-Back Sensitive Ant Model (SB-SAM).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.