Abstract
The Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem, which is an extension of the famous travelling salesman problem (TSP) classified as NP-Hard. The MTSP can be generalized to a wide variety of routing and scheduling problems. The paper proposes a novel metaheuristic called Elephant Herding Optimization (EHO) to solve the MTSP. The EHO algorithm is bio-inspired from the natural herding behavior of elephant groups, which has proved its efficiency in solving the classic TSP and continued optimization problems. So, to extend the application of this algorithm, The paper makes the attempt to show how the EHO algorithm can be applied to the MTSP by testing some random benchmark instances of TSPLIB. The obtained results shows the performance of the proposed method.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
