A parallel tour-building heuristic for the m-traveling salesmen problem

0.00 Avg rating—0 Votes

Article ID:	iaor1993798
Country:	Portugal
Volume:	11
Issue:	1
Start Page Number:	70
End Page Number:	79
Publication Date:	Jun 1991
Journal:	Investigao Operacional
Authors:	Paraiba Lourival C.
Keywords:	heuristics

Abstract:

A solution method is presented to solve the m-traveling salesman problem (m-TSP) based on a parallel tour building heuristic. Computational results concerning the behavior of the proposed algorithm are discussed. The m-TSP set includes networks with different geographical dispersion of the n-customers, with 30•n•120 and 1•m•10.

Reviews

Required fields are marked *. Your email address will not be published.