A hybrid algorithm for the path center problem

Author(s):

Maryam Rahbari , Jafar Fathali , Reza Mortazavi

Abstract:
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 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.
Keywords:

Genetic algorithm , Ant colony , Location theory , Path center , Hybrid algorithm

Language:
English
Published:
Analytical and Numerical Solutions for Nonlinear Equations, Volume:1 Issue: 2, Summer and Autumn 2016
Pages:
83 to 92
https://www.magiran.com/p1696923  
سامانه نویسندگان
  • Fathali، Jafar
    Author (2)
    Fathali, Jafar
    Professor Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrud, Iran
اطلاعات نویسنده(گان) توسط ایشان ثبت و تکمیل شده‌است. برای مشاهده مشخصات و فهرست همه مطالب، صفحه رزومه را ببینید.
مقالات دیگری از این نویسنده (گان)