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 simulated annealing (SA) that solves the problem on-line, adapts itself to the client's computer configuration, and supports articles with different widths.
منابع مشابه
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 newsp...
متن کامل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...
متن کامل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 solution to the facility layout problem using simulated annealing
Ž . In this paper a solution in the continual plane to the Facility Layout Problem FLP is presented. It is based on Simulated Ž . Annealing SA , a relatively recent algorithm for solving hard combinatorial optimization problems, like FLP. This approach Ž . may be applied either in General Facility Layout Problems GFLP considering facilities areas, shapes and orientations or in Ž . Machine Layou...
متن کاملOptimal Layout Design for Agricultural Facility Using Simulated Annealing
In this study, optimal layout design approach was used to solve problems related to site layout design of agricultural facilities such as refrigeration house, grading and packing house and warehouse. A basic program to support the rational construction of such facilities using Simulated Annealing (SA), one heuristic algorithm and one solution for combinatorial optimization problems, was coded i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
دوره 32 5 شماره
صفحات -
تاریخ انتشار 2002