|
|
|
|
a hybrid algorithm for the path center problem
|
|
|
|
|
|
|
|
نویسنده
|
rahbari maryam ,fathali jafar ,mortazavi reza
|
|
منبع
|
analytical and numerical solutions for nonlinear equations - 2016 - دوره : 1 - شماره : 2 - صفحه:83 -92
|
|
چکیده
|
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 ahybrid 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.
|
|
کلیدواژه
|
genetic algorithm ,ant colony ,location theory ,path center ,hybrid algorithm
|
|
آدرس
|
shahrood university of technology, department of mathematics, ایران, shahrood university of technology, department of mathematics, ایران, damghan university, department of mathematics, ایران
|
|
پست الکترونیکی
|
r- mortazavi@du.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
عنوان
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|