Dear Utsav Kakkad,

I suggest you to see links and attached files on topic.

-(PDF) Improved Ant Colony Optimization Routing Protocol for Wireless ...

https://www.researchgate.net/.../278662529_Improved_Ant_Colon...

- USING ANT COLONY OPTIMIZATION (ACO) - Semantic Scholar

https://pdfs.semanticscholar.org/.../4db449edd387ac800d392bc94...

- Routing in Wireless Sensor Networks Using an Ant Colony Optimization

citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.271...

- An improved ant colony optimization-based approach with mobile sink ...

https://link.springer.com/article/10.1007/s11227-017-2115-6

Best regards

Upon just looking quickly on the graphs, it appears to not be TAP or QAP, but more like a problem over a tree with perhaps some extra links. The information is not really ideal to get well informed. I suggest you find a scholar in that exact field, and get real science out of it.

Hi All

The ACO meta heuristic has been defined by their authors (Dorigo et al.) when they try to generalize their Ant System heuristic used first for the TSP for other kinds of problems, under four conditions:

The ACO meta heuristic can be and have been used for QAP and WSN (both QAP and WSN's applications verify the four previous conditions).

Your confusion is, so, very obvious and inevitable :

You try to apply the ACO meta heuristic for WSN's applications using one of two combinatorial optimization problems: TSP ( Travelling Salesman Problem) or QAP (Quadratic Assignment Problem) !!!!!!!!!!!!!!!!!!!!!!!!!!!

Applying a meta-heuristic for a problem using a problem!

I'm missing some thing or I miss-understand your problem?

Sincerely, Djamel.

thanks I will look into it