New results of ant algorithms for the linear ordering problem

MaRDI QIDQ2893627zbMATH OpenFDO

Authors Camelia-M. Pintea, Camelia Chira, Dan Dumitrescu

Publication date 21 June 2012

Published in Analele Universității de Vest din Timișoara. Seria Matematică-Informatică (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1208.5340

zbMATH Keywords

ants behaviourgraph algorithmsmetaheuristics

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An improved ant colony system for the sequential ordering problem
• A new heuristic algorithm solving the linear ordering problem
• An enhanced Ant Colony System for the Sequential Ordering Problem
• New Approximation Techniques for Some Linear Ordering Problems
• Ant algorithms for a time and space constrained assembly line balancing problem
• scientific article; zbMATH DE number 3902051
• The linear ordering problem: instances, search space analysis and algorithms
• Efficient local search algorithms for the linear ordering problem
• scientific article; zbMATH DE number 1303559
• A new rank based version of the ant system. -- A computational study

Cited in

(4)

• An improved ant colony system for the sequential ordering problem
• A new rank based version of the ant system. -- A computational study
• scientific article; zbMATH DE number 2013555 (Why is no real title available?)
• An enhanced Ant Colony System for the Sequential Ordering Problem

This page was built for publication: New results of ant algorithms for the linear ordering problem

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