ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Solving the linear ordering problem using ant models
Full text PdfPdf (354 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 4: combinatorial optimization and metaheuristics table of contents
Pages: 1803-1804  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Camelia Chira  Babes-Bolyai University, Cluj-Napoca, Romania
Camelia M. Pintea  Babes-Bolyai University, Cluj-Napoca, Romania
Gloria C. Crisan  Centre Interuniversitaire de Recherche sur les Reseaux d'Entreprise, la Logistique et le Transport, Montreal, Canada
D. Dumitrescu  Babes-Bolyai University, Cluj-Napoca, Romania
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570170
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
M. Dorigo, L.M. Gambardella, "Ant Colony System: A cooperative learning approach to the traveling salesman problem," IEEE Trans. on Systems, Man, and Cybernetics, 26, 29--41, 1996.
 
3
 
4
 
5
M.G.C. Resende, C.C. Ribeiro, "Greedy randomized adaptive search procedures: Advances and applications," Handbook of Metaheuristics, 2nd Edition, Springer, 2008.
 
6

Collaborative Colleagues:
Camelia Chira: colleagues
Camelia M. Pintea: colleagues
Gloria C. Crisan: colleagues
D. Dumitrescu: colleagues