Abstract
This paper presents a new approach to the pagination problem. This problem has traditionally been solved offline for a variety of applications like the pagination of Yellow Pages or newspapers, but since these services have appeared in Internet, a new approach is needed to solve the problem in real time. This paper is concerned with the problem of paginating a selection of articles from web newspapers that match a query sent to a personalized news site by a user. The result should look like a real newspaper and adapt to the client's computer configuration (font faces and sizes, screen size and resolution, etc.). A combinatorial approach based on Simulated Annealing and written in JavaScript is proposed to solve the problem online in the client's computer. Experiments show that the SA achieves real time layout optimization for up to 50 articles.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.H.L. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley, 1989.
Netscape Communications Corporation. Javascript developer central. Web address: http://developer.netscape.com/tech/javascript.
K. de Jong. An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, Dept. of Computer and Communications Sciences, University of Michigan, Ann Arbor, 1975.
J. González and J.J. Merelo. Optimizing web page layout using an annealed genetic algorithm as client-side script. In A. E. Eiben, T. Bäck, M. Schoenauer, and H. P. Schwefel, editors, Proceedings of the 5th Conference on Parallel Problem Solving from Nature, volume 1498 of Lecture Notes in Computer Science, pages 1018–1027, Amsterdam, The Netherlands, September 1998. Springer-Verlag.
W. H. Graf. Graf's home page. Web address: http://www.dfki.de/~graf/.
O. Kamba, K. Bharat, and M. C. Albers. The Krakatoa chronicle—an interactive, personalized newspaper on the web. Technical Report Number 95-25, Technical Report, Graphics, Visualisation and Usability Center, Georgia Institute of Technology, USA, 1995.
S. Kirkpatrick. Optimization by simulated annealing—quantitative studies. J. Stat. Phys., 34, 975–986, 1984.
S. Kirkpatrick, C.D. Gerlatt and M.P. Vecchi. Optimization by simulated annealing. Science 220, 671–680, 1983.
K. Lagus, I. Karanta and J. Ylàa-Jààski. Paginating the generalized newspapes—a comparison of simulated annealing and a heuristic method. In Hans-Michael Voigt, Werner Ebeling, Ingo Rechenberg, and Hans-Paul Schwefel, editors, Proceedings of the 4th Conference on Parallel Problem Solving from Nature, volume 1141 of Lecture Notes in Computer Science, pages 595–603, Dortmund, Germany, September 1996. Springer-Verlag.
S. Martello and P. Toth. Bin Packing Problem, Chapter 8 in Knapsack Problems, Algorithms and Computer Implementations. John Wiley & Sons Ltd., 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, J., Merelo, J.J., Castillo, P.A., Rivas, V., Romero, G. (1999). Optimizing web newspaper layout using simulated annealing. In: Mira, J., Sánchez-Andrés, J.V. (eds) Engineering Applications of Bio-Inspired Artificial Neural Networks. IWANN 1999. Lecture Notes in Computer Science, vol 1607. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100543
Download citation
DOI: https://doi.org/10.1007/BFb0100543
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66068-2
Online ISBN: 978-3-540-48772-2
eBook Packages: Springer Book Archive