GAME computer code (Genetic Algorithm with MEtropolis simulation): User manual
This document describes the (Genetic Algorithm with MEtropolis (GAME) computer code and is intended to provide the reader with enough detailed information to use the code. In this short note we have presented a hybrid search method based on a short contamination between Genetic Algorithm (direct tournament method) and Simulated Annealing, where the Metropolis algorithm was used to select between sons and parents at the end of the tournament phase. Another characteristic of this note is the use of optimally spaced quasi random numbers for the generation of initial population, which should ensure a good scanning of the input parameters space before the actual search is started. The code is quite easy to use and to couple with user's application.
Bibliographic Reference: EUR 17281 EN (1996) 36pp., FS, free of charge
Availability: Available from the Public Relations and Publications Unit, JRC Ispra, I-21020 Ispra (IT), Fax: +39-332-785818
Record Number: 199710089 / Last updated on: 1997-02-28
Original language: en
Available languages: en