Solving large travelling salesman problems with small populations

@inproceedings{Yang1997SolvingLT,
  title={Solving large travelling salesman problems with small populations},
  author={Rong Yang},
  year={1997}
}
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 populationbut 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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

World-Record Traveling Salesman Problem for 3038 Cities Solved

  • CRPC Newsletter
  • Web Page, http://www.crpc.rice.edu/CRPC…
  • 1993
1 Excerpt

Fast Algorithms for Geometric Traveling Salesman Problems

  • J. L. Bentley
  • ORSA Journal on Computing, (4):387–411
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…