Optimization of newspaper pagination using the simulated annealing algorithm and the genetic algorithm

Abstract

Newspaper pagination has become an NP-hard problem with the need to optimized the space of a newspaper. A well paginated newspaper is a newspaper which includes a high number of advertisements and articles along with pagination rules. The research problem is to find an efficient algorithm to generate a well paginated newspaper. Most of the literature related to newspaper pagination indicated the use of the Simulated Annealing (SA) algorithm to solve the problem. In this research study, we introduce an improved method of using the Genetic Algorithm (GA) to solve the problem along with a method of deriving as improved solution using SA. This research study also includes a comparison of statistical data from the two algorithms.