Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem

@inproceedings{Carter2004DesignAA,
  title={Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem},
  author={Arthur E. Carter},
  year={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

References

Publications referenced by this paper.
Showing 1-10 of 43 references

A genetic algorithm for service level based vehicle scheduling

  • C. Malmborg
  • European Journal of Operational Research,
  • 1996
Highly Influential
9 Excerpts

A study of permutation crossover operators on the traveling salesman

  • D. Smith, J. Holland
  • Future Generation Computer Systems,
  • 1987
Highly Influential
9 Excerpts

A production scheduling problem using genetic algorithm

  • R. Knosala, T. Wal
  • Journal of Materials Processing Technology,
  • 2001
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…