Documentation of objtsplib

Global Index (all files) (short | long) | Local contents | Local Index (files in subdir) (short | long)

Function Synopsis

ObjVal = objtsplib(routes, option, AddPara1)

Help text

 OBJective function for the traveling salesman library

 This function computes the length of the routes given by the
 individuals. The variables of the individuals define the order
 of the points to travel. The distance between all points is 
 given by the parameter option (DistMat).
 These problems are known as Travelling salesman (TSP).
 This function provides the objective function for most of the
 problems in the TSPLIB.

 Syntax: ObjVal = objtsplib(routes, option)

 Input parameter:
    routes    - Matrix containg the variables of the individuals 
                   (the points of the routes).
    option    - if routes contains a matrix with the individuals, 
                   than option contains the name of the tsp example 
                   file (TSPLibFunName)
                elseif routes == [], than
                option == 1 (or []) return boundaries (here just 
                             the number of variables and the 
                             corresponding upper/lower bounds)
                option == 2 return title for figures or docu
                option == 3 return value of global minimum
    TSPLibFunName - additional parameter, string with name of TSPLib problem 
                    see objtsplib for more info

 Output parameter:
    ObjVal    - Matrix containing the objective values for the individuals
                  in routes (length of the routes).

 See also: scrtsplib, tbxperm, initpp, mutswap, mutexch, recgp, recpm

Cross-Reference Information

This function calls This function is called by
GEATbx: Main page  Tutorial  Algorithms  M-functions  Parameter/Options  Example functions 

This document is part of version 3.8 of the GEATbx: Genetic and Evolutionary Algorithm Toolbox for use with Matlab -
The Genetic and Evolutionary Algorithm Toolbox is not public domain.
© 1994-2006 Hartmut Pohlheim, All Rights Reserved, (