Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Research Journal of Applied Sciences, Engineering and Technology

    Abstract
2012(Vol.4, Issue:20)
Article Information:

Object-Guided Ant Colony Optimization Algorithm with Enhanced Memory for Traveling Salesman Problem

Lijin Wang, Rongying Cai, Lin Jing and Hui Zhang
Corresponding Author:  Lijin Wang 
Submitted: December 20, 2011
Accepted: April 23, 2012
Published: October 15, 2012
Abstract:
In this study, we presents an object-guided ACO algorithm which is consisted of ants with enhanced memory. In the process of solution construction, each ant stores a complete solution in its enhanced memory. Each time ant selects a solution component probabilistically, it will calculate the difference between current solution and the new solution after adding the selected component and then Metropolis accepting rule, which has been used in simulated annealing algorithm successfully, is used to decide whether to accept the component or discard it. The simulation results, which were carried on benchmark traveling salesman problems, show that the improvement of individual intelligence can improve the performance of ACO algorithm remarkably.

Key words:  Ant colony optimization , individual intelligence, object-guided, traveling salesman problem, , ,
Abstract PDF HTML
Cite this Reference:
Lijin Wang, Rongying Cai, Lin Jing and Hui Zhang, . Object-Guided Ant Colony Optimization Algorithm with Enhanced Memory for Traveling Salesman Problem. Research Journal of Applied Sciences, Engineering and Technology, (20): 3999-4006.
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved