The Clustered Traveling Salesman Problem: A Genetic Approach

A genetic algorithm based welding planner capable of using parametric features to determine the manufacturing cost of welded assemblies has been developed. Parametric weld feature information obtained from a CAD system is translated to a hybrid traveling salesman problem. A genetic algorithm is used to search for a sequence of welds that minimizes the cost of the welded assembly. Emphasis is placed on developing a mechanistic, feature based DFM tool, with the aim of rapidly providing welded assembly cost feedback to the designer in a CAD environment, while maintaining a balance between accuracy and computational speed.

Download Full-text

Evolutionary Divide and Conquer (I): A Novel Genetic Approach to the TSP

Evolutionary Computation ◽

10.1162/evco.1993.1.4.313 ◽

1993 ◽

Vol 1 (4) ◽

pp. 313-333 ◽

Cited By ~ 21

Author(s):

Christine L. Valenzuela ◽

Antonia J. Jones

Keyword(s):

Genetic Algorithm ◽

Genetic Algorithms ◽

Traveling Salesman Problem ◽

Traveling Salesman ◽

Divide And Conquer ◽

Search Problem ◽

Genetic Approach ◽

Solution Quality ◽

Alternative Approach ◽

The Traveling Salesman Problem

Experiments with genetic algorithms using permutation operators applied to the traveling salesman problem (TSP) tend to suggest that these algorithms fail in two respects when applied to very large problems: they scale rather poorly as the number of cities n increases, and the solution quality degrades rapidly. We propose an alternative approach for genetic algorithms applied to hard combinatoric search which we call Evolutionary Divide and Conquer (EDAC). This method has potential for any search problem in which knowledge of good solutions for subproblems can be exploited to improve the solution of the problem itself. The idea is to use the genetic algorithm to explore the space of problem subdivisions rather than the space of solutions themselves. We give some preliminary results of this method applied to the geometric TSP.

Download Full-text

A new genetic approach for the traveling salesman problem

Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence ◽

10.1109/icec.1994.350051 ◽

2002 ◽

Cited By ~ 24

Author(s):

T.N. Bui ◽

B.R. Moon

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

Genetic Approach ◽

The Traveling Salesman Problem

Download Full-text

A Model for Multiple Traveling Salesman Problem with Mixed Type Vehicles

Korean Journal of Logistics ◽

10.15735/kls.2018.26.4.008 ◽

2018 ◽

Vol 26 (4) ◽

pp. 115-130

Author(s):

Jin-Wook Kim ◽

채준재

Keyword(s):

Traveling Salesman Problem ◽

Mixed Type ◽

Traveling Salesman ◽

Multiple Traveling Salesman Problem

Download Full-text

Grafos hamiltonianos aplicado al turismo de Panamá

Investigación y Pensamiento Crítico ◽

10.37387/ipc.v7i1.12 ◽

2019 ◽

Vol 7 (1) ◽

pp. 109-113

Author(s):

Julio Trujillo

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman

Un problema clásico de Teoría de Grafos es encontrar un camino que pase por varios puntos, sólo una vez, empezando y terminando en un lugar (camino hamiltoniano). Al agregar la condición de que sea la ruta más corta, el problema se convierte uno de tipo TSP (Traveling Salesman Problem). En este trabajo nos centraremos en un problema de tour turístico por la ciudad de Panamá, transformándolo a un problema de grafo de tal manera que represente la situación planteada.

Download Full-text