Optimizing Web Newspaper Layout Using Simulated Annealing
نویسندگان
چکیده
This paper presents a new approach to the pagination problem. This problem has traditionally been solved ooine 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 connguration (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 GA achieves real time layout optimization for up to 50 articles.
منابع مشابه
Web newspaper layout optimization using simulated annealing
The Web newspaper pagination problem consists of optimizing the layout of a set of articles extracted from several Web newspapers and sending it to the user as the result of a previous query. This layout should be organized in columns, as in real newspapers, and should be adapted to the client Web browser configuration in real time. This paper presents an approach to the problem based on simula...
متن کاملOptimization of web newspaper layout in real time
The web newspaper pagination problem consists in optimizing the layout of a set of articles extracted from several web newspapers and sending it to the user as the result of a previous query. This layout should be as similar as possible to that of real newspapers and should be adapted to the user's web browser con®guration in real time. Previous approaches to the problem took rather a long time...
متن کاملMulti-start simulated annealing for dynamic plant layout problem
In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملA simulated annealing algorithm to determine a group layout and production plan in a dynamic cellular manufacturing system
In this paper, a mixed-integer linearized programming (MINLP) model is presented to design a group layout (GL) of a cellular manufacturing system (CMS) in a dynamic environment with considering production planning (PP) decisions. This model incorporates with an extensive coverage of important manufacturing features used in the design of CMSs. There are also some features that make the presented...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999