Paginating the Generalized Newspapers -A Comparison of Simulated Annealing and a Heuristic Method

摘要

We consider the problem of placing ready-made boxes (containing e.g. articles) on the pages of a generalized newspaper. Three methods - one utilizing heuristic search, and two utilizing simulated annealing - are presented and compared. The second simulated annealing implementation emerged as the best method. It uses only one simple but powerful state transformation. In our view its success is due to clever use of domain knowledge in the design of the model.