The tour construction and improvement method an alternative approach to the multiple traveling salespersons problem
The traveling salesperson problem (TSP) is a classical combinatorial optimization problem which finds a route for a salesperson required to visit a set of locations exactly once and return to the starting location after the trip. Its application has been widely recognized in various industries which...
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | English |
| 主題: |