For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
In recent years, there has been an increase in research activities on Memetic Algorithm (MA). MA works with memes; a meme being defined as “the basic unit of cultural transmiss...
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...