Pirozmand, P. Et Al. 2023. D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm. IEEE Access , vol.11 , 106544-106566.

Pirozmand, P., Hosseinabadi, A. A. R., Chari, M. J., Pahlavan, F., Mirkamali, S., Weber, G., ... Nosheen, S.(2023). D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm. IEEE Access , vol.11, 106544-106566.

Pirozmand, Poria Et Al. "D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm," IEEE Access , vol.11, 106544-106566, 2023

Pirozmand, Poria Et Al. "D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm." IEEE Access , vol.11, pp.106544-106566, 2023

Pirozmand, P. Et Al. (2023) . "D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm." IEEE Access , vol.11, pp.106544-106566.

@article{article, author={Poria Pirozmand Et Al. }, title={D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm}, journal={IEEE Access}, year=2023, pages={106544-106566} }