An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications. However, most of the studies intended to deal with classical MTSP, very limited attention has been given to an open multiple travellin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2021-01-01
|
| Series: | Decision Science Letters |
| Online Access: | http://www.growingscience.com/dsl/Vol10/dsl_2021_22.pdf |