Test Problems

Subject: Test Problems
From: LUIZ SATORU OCHI (satoru@dcc.ic.uff.br)
Date: Tue Nov 30 1999 - 16:32:34 MET

Dear Colleagues,

 I am working with some generalizations of the
Traveling Salesman Problem : The Traveling Purchaser Problem (TPP);
The Covering Tour Problem (CTP) and The Prize Collection Problem (PCP)
and I would like to find test problems and/or programs using heuristics which
solve the TPP, CTP and PCP in order to analyze our metaheuristic algorithms.
 Thank you in advance

Luiz Satoru Ochi Universidade Federal Fluminense Niteroi - Rio de
Janeiro - BRAZIL e mail: satoru@dcc.ic.uff.br

               Luiz Satoru Ochi
         Universidade Federal Fluminense
         Instituto de Computacao - Departamento de Ciencia da Computacao
         Bloco E, sala 328, 3 andar
         Rua Passo da Patria,156 - Niteroi - Rio de Janeiro - 24210-240
         Phone: +55 21 717 0970 voice/fax: +55 21 717 0812
         e_mail: satoru@dcc.ic.uff.br ; satoru@pegasus.pgcc.uff.br

This archive was generated by hypermail 2b25 : Fri Mar 03 2000 - 16:17:18 MET