Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The ant colony system (ACS) algorithm is a new meta-heuristic for hard combinational optimization problems. It is a population-based approach that uses the exploitation of positive feedback as ll as a greedy search. It was first proposed for tackling the ll-known traveling salesman problem (TSP). ,  introduce a new version of the ACS based on a dynamic ighted updating method and a dynamic ant number decision method using a curve-fitting algorithm. An implementation to solve the TSP and performance results under various conditions are presented, and a comparison beten the original ACS and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed for these problems.
['SeungGwan Lee', 'TaeUng Jung', 'TaeChoong Chung']
I am writing a research paper on a idea Improved ant agents system by the dynamic parameter decision
[{"from": "human", "value": "I am writing a research paper on a idea Improved ant agents system by the dynamic parameter decision"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The ant colony system (ACS) algorithm is a new meta-heuristic for hard combinational optimization problems. It is a population-based approach that uses the exploitation of positive feedback as ll as a greedy search. It was first proposed for tackling the ll-known traveling salesman problem (TSP). ,  introduce a new version of the ACS based on a dynamic ighted updating method and a dynamic ant number decision method using a curve-fitting algorithm. An implementation to solve the TSP and performance results under various conditions are presented, and a comparison beten the original ACS and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed for these problems."}]