Using Mathematical Optimization Method(Tabu Search) for Edges CrossingPoints Reduction in Graphs


A graph is an algebraic structure of nodes and edges is commonly presented geometrically by diagrams depicting nodes as dots and edges as curves or straight line segments that connect the dots . Some applications need to reduce the number of edges crossing such as Telecommunications e.g. spanning trees ,Vehicle routing e.g. Roads without underpasses, VLSI e.g. computer chips , and Road networks. This aim of this paper is minimize the number of crossing points in graphs by applying the mathematical optimization (Tabu Search) method. More important results was recorded by implement this method .