New results of ant algorithms for the Linear Ordering Problem

08/27/2012
by   Camelia-M. Pintea, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2022

The directed plump ordering

Based on Taylor's hereditarily directed plump ordinals, we define the di...
research
05/18/2014

A Multi-parent Memetic Algorithm for the Linear Ordering Problem

In this paper, we present a multi-parent memetic algorithm (denoted by M...
research
02/13/2013

An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits

Many algorithms for processing probabilistic networks are dependent on t...
research
08/08/2022

Reliability of Solutions in Linear Ordering Problem: New Probabilistic Insight and Algorithms

In this work, our goal is to characterize the reliability of the solutio...
research
04/08/2022

Learning the Ordering of Coordinate Compounds and Elaborate Expressions in Hmong, Lahu, and Chinese

Coordinate compounds (CCs) and elaborate expressions (EEs) are coordinat...
research
04/15/2019

Efficiently Exploring Ordering Problems through Conflict-directed Search

In planning and scheduling, solving problems with both state and tempora...
research
03/06/2013

Deriving a Minimal I-map of a Belief Network Relative to a Target Ordering of its Nodes

This paper identifies and solves a new optimization problem: Given a bel...

Please sign up or login with your details

Forgot password? Click here to reset