Abstract
AbstractThis paper presents an improved version of the Vantage Point Bees Algorithm (VPBA‐II), which is implemented to solve the Travelling Salesman Problem. The Vantage Point Tree has been used to produce initial tour solutions and also as a global search operator of the proposed algorithm to find the minimal Hamiltonian tour of the Travelling Salesman Problem. VPBA‐II is tested on 15 different benchmark datasets from TSPLIB, particularly for the high dimensional combinatorial solution spaces, and it outperformed the basic Bees Algorithm. The composition of the local search operators combined with Vantage Point Tours perform better except one dataset and achieved optimum results according to best‐known solutions of Travelling Salesman Problem as a best‐case scenario. The experiments prove that Vantage Point Tour construction could be used as initialization and global search operator to improve the basic Bees Algorithm performance on the combinatorial domains.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
