| Article ID: | iaor1989257 |
| Country: | United Kingdom |
| Volume: | 40 |
| Issue: | 7 |
| Start Page Number: | 637 |
| End Page Number: | 642 |
| Publication Date: | Jul 1989 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Okonjo-Adigwe C. |
| Keywords: | programming: network, programming: travelling salesman |
An optimal solution is found to a real-world problem which has the characteristics of a multiple travelling-salesman problem. It deals specifically with methods of obtaining the ‘best’ routeing for four vehicles which provide a daily service from a depot to 38 locations. The solution technique uses both heuristic and exact algorithms to derive the order for visits ot the 38 locations.