Description: 5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab program 5, respectively, the following situations: 1. Back to the starting point a different starting point (TSP fixed amount) 2. Back to the starting point a different starting point (TSP amount calculated variable) 3. Starting the same starting point back to the beginning 4. Starting the same starting point to the starting point is not 5. Starting the same starting point back to the same end point (with different starting points)
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 2018-51MCM-Appendix B (English).xlsx | 159437 | 2018-04-25
|
| 2018-51MCM-Appendix B.xlsx | 159467 | 2018-04-25
|
| 2018-51MCM-Problem A (English).doc | 390656 | 2018-04-28
|
| 2018-51MCM-Problem A.doc | 590336 | 2018-04-28
|
| 2018-51MCM-Problem B (English).docx | 22487 | 2018-04-28
|
| 2018-51MCM-Problem B.docx | 22555 | 2018-04-28
|
| 2018-51MCM-Problem C (English).docx | 19033 | 2018-04-28
|
| 2018-51MCM-Problem C.docx | 18951 | 2018-04-28
|
| 2018-51MCM-论文提交说明.docx | 205087 | 2018-04-29
|
| 2018-51MCM-论文模板.doc | 42930 | 2018-04-29 |
Download