Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
An Improved Memetic Genetic Algorithm Based On A Complex Network As Asolution To The Traveling Salesman Problem, Hadi Mohammadi, Kamal Mirzaie, Mohammad Reza Mollakhalili Meybodi
An Improved Memetic Genetic Algorithm Based On A Complex Network As Asolution To The Traveling Salesman Problem, Hadi Mohammadi, Kamal Mirzaie, Mohammad Reza Mollakhalili Meybodi
Turkish Journal of Electrical Engineering and Computer Sciences
A genetic algorithm (GA) is not a good option for finding solutions around in neighborhoods. The current study applies a memetic algorithm (MA) with a proposed local search to the mutation operator of a genetic algorithm in order to solve the traveling salesman problem (TSP). The proposed memetic algorithm uses swap, reversion and insertion operations to make changes in the solution. In the basic GA, unlike in the real world, the relationship between generations has not been considered. This gap is resolved using the proposed complex network to allow selection among possible solutions. The degree measure has been used for …
Graph Analysis Of Network Flow Connectivity Behaviors, Hangyu Hu, Xuemeng Zhai, Mingda Wang, Guangmin Hu
Graph Analysis Of Network Flow Connectivity Behaviors, Hangyu Hu, Xuemeng Zhai, Mingda Wang, Guangmin Hu
Turkish Journal of Electrical Engineering and Computer Sciences
Graph-based approaches have been widely employed to facilitate in analyzing network flow connectivity behaviors, which aim to understand the impacts and patterns of network events. However, existing approaches suffer from lack of connectivity-behavior information and loss of network event identification. In this paper, we propose network flow connectivity graphs (NFCGs) to capture network flow behavior for modeling social behaviors from network entities. Given a set of flows, edges of a NFCG are generated by connecting pairwise hosts who communicate with each other. To preserve more information about network flows, we also embed node-ranking values and edge-weight vectors into the original …