A Hybrid Evolutionary Algorithm for the Page Number Minimization Problem

In this paper we present a hybrid evolutionary algorithm (HEA) for solving the pagenumber problem. In HEA. random depth first search of the graph is used for placing the vertices on the spine and an edge embedding heuristic is designed to distribute the edges on a minimal number of pages. The results show that the algorithm achieves the optimal pagenumber for most of the standard graphs tested by us. HEA performance is also compared with the GA described by Kapoor et al. [1] on select instances of standard and random graphs. It is observed that HEA gives a better solution for most of the instances.