Paginating the generalized newspaper: A comparison of simulated annealing and a heuristic method

Krista Lagus, Ilkka Karanta, Juha Ylä-Jääski

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    8 Citations (Scopus)

    Abstract

    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.
    Original languageEnglish
    Title of host publicationParallel Problem Solving from Nature PPSN IV
    Subtitle of host publicationInternational Conference on Evolutionary Computation
    EditorsHans-Michael Voigt, Werner Ebeling, Ingo Rechenberg, Hans-Paul Schwefel
    Place of PublicationBerlin
    PublisherSpringer
    Pages549-603
    ISBN (Electronic)978-3-540-70668-7
    ISBN (Print)978-3-540-61723-5
    DOIs
    Publication statusPublished - 1996
    MoE publication typeA4 Article in a conference publication
    Event4th International Conference on Parallel Problem Solving from Nature - Berlin, Germany
    Duration: 22 Sept 199626 Sept 1996

    Publication series

    SeriesLecture Notes in Computer Science
    Volume1141
    ISSN0302-9743

    Conference

    Conference4th International Conference on Parallel Problem Solving from Nature
    Country/TerritoryGermany
    CityBerlin
    Period22/09/9626/09/96

    Fingerprint

    Dive into the research topics of 'Paginating the generalized newspaper: A comparison of simulated annealing and a heuristic method'. Together they form a unique fingerprint.

    Cite this