| Article ID: | iaor19891048 |
| Country: | Netherlands |
| Volume: | 41 |
| Issue: | 2 |
| Start Page Number: | 224 |
| End Page Number: | 231 |
| Publication Date: | Jul 1989 |
| Journal: | European Journal of Operational Research |
| Authors: | Keller C. Peter |
| Keywords: | programming: integer |
The multiobjective vending problem (MVP) is a generalization of the traveling salesman problem (TSP) where it is not necessary to visit all nodes in the problem definition. A special case of the MVP is the orienteering problem (OP). The problems are NP-hard. A heuristic was designed to solve the general MVP. Three other heuristics were designed to solve the OP. The algorithms underlying these heuristics are outlined. Their performances are compared against three OP problems.