Dear Reza Shahin,

I think going through these links will allow you to choose the most suitable metaheuristic algorithm for your problem.

http://webpages.iust.ac.ir/yaghini/Courses/AOR_891/03_Metaheuristic%20Development%20Methodology.pdf

http://webpages.iust.ac.ir/yaghini/Courses/AOR_872/What%20is%20a%20Metaheuristic.pdf

http://www.scholarpedia.org/article/Metaheuristic_Optimization

https://stackoverflow.com/questions/49125106/optimization-approaches-meta-heuristic-graph-based-milp

Best regards

Here are some thoughts about subject:

1. you could look at this survey

- Heuristics based on mathematical programming

Article Heuristics based on mathematical programming

- Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: Quality, uncertainty and speed

Article Choice of best possible metaheuristic algorithm for the trav...

2. In general you should use the metaheuristics that you are familiar with. Also if possible you should consult someone using those mataheuristics. There are a lot of fine tuning to obtain a decent result.

3. Read the recent literature, because it is not wise use of time to reinvent the wheel. Someone might have done it already making your effort fruitless.

4. In addition to that, If there are a lot of metaheuristics on this particular problem then yet another metaheuristic on that problem might be hard to publish.

5. Of course research the problem, it should be in NP class in order to make metaheuristics meaningful.

I hope that this is of some help.

In general, it is not a better metaheuristic than the other ones. But there are general approaches for facing the practical problems: in your cases it is needed to make evolve one or more solutions populations. In the work attached you could find a useful approach for facing your problem. Neverless, would be useful using more than one metaheuristic and to compare them by different indicators