The multiobjective vending problem: A generalisation of the travelling salesman problem

The multiobjective vending problem: A generalisation of the travelling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor1988755
Country: United Kingdom
Volume: 15
Issue: 4
Start Page Number: 447
End Page Number: 460
Publication Date: Oct 1988
Journal: Environment and Planning B
Authors: ,
Keywords: programming: multiple criteria, programming: travelling salesman
Abstract:

A generalization of the travelling salesman problem is introduced. Each mode has an associated reward, and a penalty is incurred by travelling between nodes. In the multiobjective vending problem, the subset of nodes and associated tour which will minimize penalty and maximize reward is sought. The problem is placed within the context of multiobjective programming. A heuristic is proposed and evaluated, and it is found to give satisfactory performance when applied to a problem with twenty-five nodes. Further generalizations are suggested.

Reviews

Required fields are marked *. Your email address will not be published.