Solving the linear ordering problem using ant models

Authors:
Camelia Chira;Camelia M. Pintea;Gloria C. Crisan;D. Dumitrescu
Affiliations:
Babes-Bolyai University, Cluj-Napoca, Romania;Babes-Bolyai University, Cluj-Napoca, Romania;Centre Interuniversitaire de Recherche sur les Reseaux d'Entreprise, la Logistique et le Transport, Montreal, Canada;Babes-Bolyai University, Cluj-Napoca, Romania
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 4
Cited 1

Intensification and diversification with elite tabu search solutions for the linear ordering problem

Computers and Operations Research
Variable neighborhood search for the linear ordering problem

Computers and Operations Research
Heterogeneous sensitive ant model for combinatorial optimization

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolutionary Approaches to Linear Ordering Problem

DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application

A genetic programming approach for solving the linear ordering problem

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant models are investigated with the purpose of providing a high-quality performing heuristic for solving the linear ordering problem. Extending the Ant Colony System (ACS) model, the proposed Step-Back Sensitive Ant Model (SBSAM) allows agents to take a 'step back' if it reaches a virtual state modulated by various sensitivity levels to the pheromone trails. An effective exploration of the search space is performed particularly by agents having low pheromone sensitivity while the exploitation of intermediary solutions is facilitated by highly-sensitive ants. Both ACS and SB-SAM techniques compete with existing heuristic methods for linear ordering in terms of solution quality.