Treffer: Travelling salesman problem modelling by mixed integer linear programming of python (MIP)
Weitere Informationen
A famous travelling salesman problem, appearing simple to state but complex to solve, has been widely investigated and various algorithms have been proposed. In this article, mixed integer linear programming of python (MIP) is used to model this problem with varying input data. The result shows that with small input data the modelling code of MIP executing quickly and converging to optimal value, while large scale input data require plenty of computation time; thereby algorithm improvement as well as parallel implementation are suggested. ; A famous travelling salesman problem, appearing simple to state but complex to solve, has been widely investigated and various algorithms have been proposed. In this article, mixed integer linear programming of python (MIP) is used to model this problem with varying input data. The result shows that with small input data the modelling code of MIP executing quickly and converging to optimal value, while large scale input data require plenty of computation time; thereby algorithm improvement as well as parallel implementation are suggested.