Damghan University Press Analytical and Numerical Solutions for Nonlinear Equations 3060-785X 1 2 2016 11 15 A hybrid algorithm for the path center problem 83 92 58 10.22128/gadm.2016.58 EN Maryam Rahbari Department of Mathematics, Shahrood University of Technology, University Blvd., Shahrood, Iran Jafar Fathali Department of Mathematics, Shahrood University of Technology, University Blvd., Shahrood, Iran REZA MORTAZAVI School of Engineering, Damghan University, Damghan, Iran 0000-0002-1889-8184 Journal Article 2015 10 21 Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and a<br />hybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all examples the hybrid method results better solutions than genetic algorithm. https://ansne.du.ac.ir/article_58_acf2233fde4719992314babcb37ed914.pdf