## A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms

- Shuai Yuan, Bradley Skinner, Shoudong Huang, Dikai Liu
- European Journal of Operational Research
- 2013

Highly Influenced

@inproceedings{Carter2004DesignAA, title={Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem}, author={Arthur E. Carter}, year={2004} }

- Published 2004

The multiple traveling salesmen problem (MTSP) is an extension of the traveling salesman problem with many production and scheduling applications. The TSP has been well studied including methods of solving the problem with genetic algorithms. The MTSP has also been studied and solved with GAs in the form of the vehicle-scheduling problem. This work presents a new modeling methodology for setting up the MTSP to be solved using a GA. The advantages of the new model are compared to existing modelsâ€¦Â CONTINUE READING

Highly Cited

This paper has 17 citations. REVIEW CITATIONS

Showing 1-10 of 43 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential