Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

YAEM 2010
YÖNEYLEM ARAÞTIRMASI VE ENDÜSTRÝ MÜHENDÝSLÝGI 30. ULUSAL KONGRESÝ
A Discrete Artificial Bee Colony Algorithm for the Generalized
Traveling Salesman Problem
1 2 3
Mehmet Fatih Tasgetiren , P. N Suganthan , Quan Ke Pan , Ece
1
Ulusans
1 Yasar University, Ýzmir, Turkey
2 Nanyang Technological University, Singapore
3 Liaocheng University, Liaocheng, China
This paper presents a discrete artificial bee colony algorithm for the
generalized traveling salesman problem where the set of nodes is
divided into clusters so that the objective is to find a tour with
minimum cost passing through exactly one node from each cluster. In
order to test the performance of the algorithm, 41 problem instances
from the GTSP library are used. Through the experimental analysis of
results, the performance of discrete artificial bee algorithm is
compared against the best performing algorithms from the literature.
Placing Regenerators in Optical Networks to Satisfy Multiple
Sets of Requests
1 2 3 2
George B. Mertzios , Ignasi Sau , Mordechai Shalom , Shmuel Zaks
1 Department of Computer Science, RWTH Aachen University, Aachen,
Germany
2 Department of Computer Science, Technion, Haifa, Israel
3 TelHai Academic College, Upper Gallilee, Israel
The placement of regenerators in optical networks has become an
active area of research during last years. Given a set of lightpaths in a
network G and an integer d, regenerators must be placed in such a
way that in any lightpath there are at most d hops without a
regenerator. Most of the previous research has focused on heuristics.
A theoretical study has been recently provided, where the considered
cost function is the number of locations in the network hosting
regenerators. A more accurate estimation of the real cost of the
network is the total number of regenerators placed at the nodes, and
this is the cost function we consider.
1194