An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
<p>The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University, Qazvin Branch
2012-07-01
|
| Series: | Journal of Optimization in Industrial Engineering |
| Subjects: | |
| Online Access: | http://www.qjie.ir/article_89_fd3d6037a76015c814dd3d82969392c0.pdf |