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

Relay node placement in wireless sensor networks using modified genetic algorithm

  • 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)
  • 2016

Metaheuristics for the deployment problem of WSN: A review

  • Microprocessors and Microsystems - Embedded Hardware Design
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

References

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

The Traveling Salesman

  • Lecture Notes in Computer Science
  • 1994
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

World-Record Traveling Salesman Problem for 3038 Cities Solved

CRPC Newsletter
  • Web Page, http://www.crpc.rice.edu/CRPC/newsletters/jan93/ news.tsp.html
  • 1993
VIEW 1 EXCERPT

Fast Algorithms for Geometric Traveling Salesman Problems

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

The Application of TABU Search to the Symmetric Traveling Salesman Problems

J. Knox
  • PhD dissertation, University of Colorado
  • 1989
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…