...................
... Fast Notes. ...
...................


                      TSP Genetic 1.0
                      ---------------
   Copyright (c) 1993 Brooklyn College, City University of New York

          Author: Yevgeny Kolyakov, k77bc@cunyvm.cuny.edu
                       Date: 06-10-93

Permission to use, copy, modify, and distribute this software
for any purpose is hereby granted without fee, provided that the
above copyright notice, author statement and this permission notice appear in
all copies of this software.

THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND, EXPRESS,
IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY WARRANTY OF
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.

IN NO EVENT SHALL THE BROOKLYN COLLEGE BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF THE
POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

(*)
   This program is a demonstration of a TSP (Traveling Salesperson Problem)
   - well known NP-complete problem solved by the means of genetic
   algorithms.

(*)
   The objective is to minimize the path between cities  visiting each city
   exactly once.

(*)
   This program uses a modified version of a standard genetic algorithm
   to optimize the distance between cities.

(*)
   TSP genetic was compiled of Miscrosoft's(tm) Visual C++ using MFC
   class library.

(*)
   In order for the program to work correctly you should place the *.vbx
   files in either one: the directory of TSP.exe or in /WINDOWS/SYSTEM
   directory.

(*)
   A user is invited to experiment with different Setup settings
   to find the one giving the best optimization.

(*)
   The algorithm presented rarely converges to an optimal solution, but
   instead converges to "close to the optimal" solution which is
   acceptable in most cases.

(*)
   The Setup dialog box contains items:
   1. Number of cities between which path is laid.
   2. Number of generations the genetic algorithm should iterate.
   3. Constant Percent - percentage of genes to be inherited by
      each child from mother.
   4. Population Size - Size of the chromosome pool.
   5. Display Every - how often should the program repaint the screen.
   6. Elite Size - number of Best chromosomes that participate in
      breeding. These best chromosomes are taken from the chromosome
      pool.
   7. Use Clock to Generate a random number - current time is used as a
      seed for the random number generator. If not checked, TSP will
      prompt for the seed.

(*)
    Path length window shows the Length of the current Best Trip.
    Progress bar shows how many generations left.

(*)
    The program was not tested throughoutly.

(*)
    I understand that documentation for this program is not adequate.

(*)
    If you have any questions or would like to make a comment please
    contact the author, Yevgeny Kolyakov at k77bc@cunyvm.cuny.edu