Competitive Decision Algorithm for Multi-Object Traveling Salesman Problem with Preference-Selection
Ning Ai-bing · Journal of Shanghai Second Polytechnic University · 2005
The importance of the Multi-Object Traveling Salesman Problem (MOTSP) varies greatly to different users. In order to satisfy varied users with different preference to the objects of MOTSP and quickly provide solutions to the users, this paper offers a competitive decision algorithm (a novel algorithm in combinatorial optimisation area) for the MOTSP with preference-selection. Numerical examples are tested and show promising results.