Development of a dummy guided formulation and exact solution method for TSP

Authors

DOI:

https://doi.org/10.15587/1729-4061.2020.203865

Keywords:

traveling salesman problem, sub-tour, block, integer linear program, dummy.

Abstract

A traveling salesman problem (TSP) is a problem whereby the salesman starts from an origin node and returns to it in such a way that every node in the network of nodes is visited once and that the total distance travelled is minimized. An efficient algorithm for the TSP is believed not to exist. The TSP is classified as NP-hard and coming up with an efficient solution for it will imply NP=P. The paper presents a dummy guided formulation for the traveling salesman problem. To do this, all sub-tours in a traveling salesman problem (TSP) network are eliminated using the minimum number of constraints possible. Since a minimum of three nodes are required to form a sub-tour, the TSP network is partitioned by means of vertical and horizontal lines in such a way that there are no more than three nodes between either the vertical lines or horizontal lines. In this paper, a set of all nodes between any pair of vertical lines or horizontal lines is called a block. Dummy nodes are used to connect one block to the next one. The reconstructed TSP is then used to formulate the TSP as an integer linear programming problem (ILP). With branching related algorithms, there is no guarantee that numbers of sub-problems will not explode to unmanageable levels. Heuristics or approximating algorithms that are sometimes used to make quick decisions for practical TSP models have serious economic challenges. The difference between the exact solution and the approximated one in terms of money is very big for practical problems such as delivering household letters using a single vehicle in Beijing, Tokyo, Washington, etc. The TSP model has many industrial applications such as drilling of printed circuit boards (PCBs), overhauling of gas turbine engines, X-Ray crystallography, computer wiring, order-picking problem in warehouses, vehicle routing, mask plotting in PCB production, etc.

Author Biography

Elias Munapo, School of Economics and Decision Sciences North-West University Mmabatho Unit 5, Mafikeng, South Africa, 2790

PhD, Professor of Operations Research

Department of Statistics and Operations Research

References

  1. Munapo, E. (2020). Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity. Intelligent Computing and Optimization, 260–272. doi: https://doi.org/10.1007/978-3-030-33585-4_26
  2. Baniasadi, P., Foumani, M., Smith-Miles, K., Ejov, V. (2020). A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. European Journal of Operational Research, 285 (2), 444–457. doi: https://doi.org/10.1016/j.ejor.2020.01.053
  3. Hougardy, S., Zaiser, F., Zhong, X. (2020). The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem. Operations Research Letters, 48 (4), 401–404. doi: https://doi.org/10.1016/j.orl.2020.05.007
  4. Campuzano, G., Obreque, C., Aguayo, M. M. (2020). Accelerating the Miller–Tucker–Zemlin model for the asymmetric traveling salesman problem. Expert Systems with Applications, 148, 113229. doi: https://doi.org/10.1016/j.eswa.2020.113229
  5. Fischetti, M., Salazar González, J. J., Toth, P. (1997). A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. Operations Research, 45 (3), 378–394. doi: https://doi.org/10.1287/opre.45.3.378
  6. Ebadinezhad, S. (2020). DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Engineering Applications of Artificial Intelligence, 92, 103649. doi: https://doi.org/10.1016/j.engappai.2020.103649
  7. Wang, S., Liu, M., Chu, F. (2020). Approximate and exact algorithms for an energy minimization traveling salesman problem. Journal of Cleaner Production, 249, 119433. doi: https://doi.org/10.1016/j.jclepro.2019.119433
  8. Rebman, K. R. (1974). Total unimodularity and the transportation problem: a generalization. Linear Algebra and Its Applications, 8 (1), 11–24. doi: https://doi.org/10.1016/0024-3795(74)90003-2
  9. Munapo, E. (2016). Second Proof That P=NP. 5th EngOpt Conference.
  10. Winston, W. L., Goldberg, J. B. (2004). Operations research: Applications and algorithms. Belmont, CA: Thomson Brooks/Cole.
  11. Gondzio, J. (2012). Interior point methods 25 years later. European Journal of Operational Research, 218 (3), 587–601. doi: https://doi.org/10.1016/j.ejor.2011.09.017

Downloads

Published

2020-06-30

How to Cite

Munapo, E. (2020). Development of a dummy guided formulation and exact solution method for TSP. Eastern-European Journal of Enterprise Technologies, 3(4 (105), 12–19. https://doi.org/10.15587/1729-4061.2020.203865

Issue

Vol. 3 No. 4 (105) (2020): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2020 Elias Munapo

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.