Pitching Video Postgraduate YPEC 2020

PG01 – A New Optimization Algorithm For the Traveling Salesman Problem (TSP)

Traveling salesman problem has a wide range of applications in the fields of transportation, circuit board design, and logistics and distribution. Scholars at home and abroad have conducted a lot of research on it. With the rise of the e-commerce industry, how to properly arrange logistics and distribution has become one of the important issues that need to be solved urgently. Bat Algorithm (BA) is a meta-heuristic optimisation algorithm, which proposed by Yang, X. S. (2010), based on the echo localisation behaviour of micro-bats through using different pulse emissivity and loudness. It is an iterative optimisation algorithm like other intelligent optimisation algorithms. The bat algorithm has the advantages of simple implementation and few parameters and has become a research hotpot in recent years. However, there are still a few applications in TSP. Therefore, this project will improve the bat algorithm to solve the optimisation problem of symmetric traveling salesman problems and compare it with other traditional heuristic algorithms to eliminate the local optimisation generated during the iterative calculation.