Article ID: | iaor20001565 |
Country: | United Kingdom |
Volume: | 26 |
Issue: | 4 |
Start Page Number: | 427 |
End Page Number: | 441 |
Publication Date: | Apr 1999 |
Journal: | Computers and Operations Research |
Authors: | Butt Steven E., Ryan David M. |
Keywords: | programming: travelling salesman, programming: mathematical |
The Multiple Tour Maximum Collection Problem (MTMCP) is closely related to the classical Traveling Salesman and Vehicle Routing Problems. One major difference with the MTMCP is that it is not possible to visit all of the nodes in the graph in the total time allocated on a given set of tours. However, with the MTMCP, a reward is collected from each node that is visited. The objective of the MTMCP is to determine which nodes to visit on