Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Computing | en_US |
| dc.creator | Wong, Chi-fai Ivan | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/3090 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | A hybrid order-based genetic algorithm solution to the classified advertisements layout problem | en_US |
| dcterms.abstract | The aim of this dissertation is to describe the hybrid order-based genetic algorithms for solving the classified advertisements layout problem in newspaper. The classified advertisements layout problem is simply to find a layout for the classified advertisements, so that the newspaper pages are fully utilization and the appearance of the newspaper pages is tidy and professional. An existing solution of this problem based on greedy algorithms will be described. After reviewing the related literature, it is found that the problem is a special case of the general "bin-packing" problems. Since the "bin-packing" problems are "NP-complete", the classified advertisements layout problem is also "NP-complete". Therefore, an exact and efficient algorithm for solving the classified advertisements layout problem there should not be exists. Although "bin-packing" problems are "NP-complete", some classical algorithms have been developed and proved to have guaranteed performances. The description of these classical algorithms will also be provided. It was found that one of the classical algorithms, the "First Fit Decreasing" (FFD) is very similar to the existing solution based on greedy algorithm. In order to improve the result provided by the existing algorithms, the existing algorithm is hybridized to genetic algorithms to form a hybrid order-based genetic algorithm for this particular problem. Then the performance of this hybrid order-based genetic algorithm is tested by comparing the performance of this algorithm with the classified algorithms and with the algorithms based on random variables. Since the genetic algorithm and the algorithms for comparison have the probabilistic nature, the comparison is actually a statistic on the performance after a number of independent try runs. | en_US |
| dcterms.extent | viii, 106 leaves : ill. ; 31 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1999 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Advertising layout and typography -- Data processing | en_US |
| dcterms.LCSH | Genetic algorithms | en_US |
| dcterms.LCSH | Advertising, Classified -- Data processing | en_US |
| dcterms.LCSH | Advertising, Newspaper -- Data processing | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b14605314.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.38 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3090