论文信息 - The Travelling Salesman Problem and its Application in Logistic Practice

The Travelling Salesman Problem and its Application in Logistic Practice

The article describes The Travelling Salesman Problem as a logistic transport task. The first part defines the TSP as a mathematical model and briefly describes main established methods of solving the problem. The second part brings experience with practical task solutions in a distribution company within specific conditions and other requirements of the transport management in the company.

Exnar Filip

[1] Teresa Murino,et al. The location - routing problem: an innovative approach , 2007 .

[2] Michal Patak,et al. Role of demand planning in business process management , 2010 .

[3] Leslie Jarvis,et al. Quantitative Methods in Management , 1996 .

[4] LAURENŢIU RUDEANU,et al. Parallel Implementation of Ant Colony Optimization for Travelling Salesman Problem , 2003 .

[5] Petrica C. Pop,et al. An ant-based technique for the dynamic generalized traveling salesman problem , 2007 .

[6] Hou Li-qiang. Improved genetic algorithm in solving TSP problem , 2006 .

[7] Izzatdin Abdul Aziz,et al. Solving traveling salesman problem on high performance computing using message passing interface , 2008 .

[8] Pan Chen,et al. Particle swarm optimization with simulated annealing for TSP , 2007 .

[9] Chen Guang-xi. An improved genetic algorithm for solving TSP problem , 2007 .

[10] Christian Artigues,et al. A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem , 2008, Comput. Oper. Res..

[11] Miguel A. Mariño,et al. Ant colony optimization algorithm (ACO): a new heuristic approach for engineering optimization , 2005 .

[12] Ismael Rodríguez,et al. Using River Formation Dynamics to Design Heuristic Algorithms , 2007, UC.

[13] Adewole Philip,et al. A Genetic Algorithm for Solving Travelling Salesman Problem , 2011 .