• DOI:10.1049/CP:19971173
Corpus ID: 15858257

Solving large travelling salesman problems with small populations

@inproceedings{Yang1997SolvingLT,
  title={Solving large travelling salesman problems with small populations},
  author={R. Yang},
  year={1997}
}

• R. Yang
• Published 1997
• Computer Science

A new genetic algorithm for the solution of the travelling salesman problem is presented in this paper. The approach is to introduce several knowledge-augmented genetic operators which guide the genetic algorithm more directly towards better quality of the population but are not trapped in local optima prematurely. The algorithm applies a greedy crossover and two advanced mutation operations based on the 2-opt and 3-opt heuristics. One of our particular interests is to investigate whether small… Expand

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed