A sensitive metaheuristic for solving a large optimization problem

  • Authors:
  • Camelia-M. Pintea;Camelia Chira;D. Dumitrescu;Petrica C. Pop

  • Affiliations:
  • Babeş-Bolyai University, Cluj-Napoca, Romania;Babeş-Bolyai University, Cluj-Napoca, Romania;Babeş-Bolyai University, Cluj-Napoca, Romania;North University, Baia-Mare, Romania

  • Venue:
  • SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A metaheuristic for solving complex problems is proposed. The introduced Sensitive Robot Metaheuristic (SRM) is based on the Ant Colony System optimization technique. The new model relies on the reaction of virtual sensitive robots to different stigmergic variables. Each robot is endowed with a particular stigmergic sensitivity level ensuring a good balance between search diversification and intensification. Comparative tests are performed on large-scale NP-hard robotic travel problems. These tests illustrate the effectiveness and robustness of the proposed metaheuristic.