Multiple Traveling Salesman Problem
Key Facts
Abbreviation
MTSP
Pronunciation
/ˈməltəpəl ˈtrævəlɪŋ ˈseɪlzmən ˈprɑbləm/
Category
Computing
Related Field
Networking
Examples in Context
- Computation and Simulation Analysis of a Kind of Multiple Traveling Salesman problem
- To solve a kind of multiple traveling salesman problem ( MTSP ) for minimizing the completion time, a hierarchical genetic algorithm ( HGA ) and decoding method with matrix are proposed.
- Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
- To solve the Multiple Traveling Salesman Problem(MTSP) ( M-TSP ), a novel DNA-GA is proposed in this paper.
- The Film Copy Deliverer Problem is the extension of the Traveling Salesman Problem and the Multiple Traveling Salesman Problem(MTSP), and it is significance in theory and practice.