A New Model of Packet tracking Using The TSP Algorithm Method

  • Richki Hardi Universitas Mulia
  • Nanna Suryana Herman Universiti Teknikal Malaysia Melaka
  • Naim Che pee Universiti Teknikal Malaysia Melaka
Keywords: package, route, tsp, tracking, web

Abstract

The packet tracking system becomes essential for the sender of the packet because, with this system, the sender can know the whereabouts or position of the package being sent. If there is a delay in delivery, the sender can also find out the cause of the delay, and it could be due to traffic, wrong address, natural disaster, or other problems. More than that, this system can determine the optimal route to be passed, namely by testing and moving several paths so that with all the possibilities that there will get the optimal path. The purpose of this study is to provide a model and find out the optimal way that is feasible to take in package delivery. The method applied in this research is to use the TSP algorithm, which is an algorithm that tries all possible routes to get the optimal path. The research area will be applied to the Aceh area, and also a request from one of the national shipping companies in Indonesia, Pos. This system will be built based on the web so that the results displayed can be reached by all areas that are connected to the internet. It is hoped that this model and system that will be built can become a reference and reference for other researchers.

References

R. Hardi and Z. Zaini, “Implementasi Sistem Keamanan Komputer Menggunakan Sistem Terintegrasi Client Server Metode Service Oriented Architecture (Soa),” JTT (Jurnal Teknol. Terpadu), 2018.

Y. Hendriana and R. Hardi, “Remote control system as serial communications mobile using a microcontroller,” in 2016 International Conference on Information Technology Systems and Innovation, ICITSI 2016 - Proceedings, 2017.

J. F. Rusdi et al., “ICT Research in Indonesia,” SciTech Framew., 2019.

R. Hardi, “Pengembangan Antivirus Berbasis Client Server,” Telematika, 2015.

S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, and H. Trautmann, “A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem,” in FOGA 2013 - Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms, 2013.

N. S.Choubey, “Fruit Fly Optimization Algorithm for Travelling Salesperson Problem,” Int. J. Comput. Appl., 2014.

S. Nallaperuma, M. Wagner, and F. Neumann, “Ant colony optimisation and the traveling salesperson problem - Hardness, features and parameter settings,” in GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion, 2013.

S. McCammon and G. A. Hollinger, “Planning and executing optimal non-entangling paths for tethered underwater vehicles,” in Proceedings - IEEE International Conference on Robotics and Automation, 2017.

P. Isaiah and T. Shima, “A task and motion planning algorithm for the dubins travelling salesperson problem,” in IFAC Proceedings Volumes (IFAC-PapersOnline), 2014.

M. Castro, K. Sörensen, P. Vansteenwegen, and P. Goos, “A memetic algorithm for the travelling salesperson problem with hotel selection,” Comput. Oper. Res., 2013.

P. Vansteenwegen, W. Souffriau, and K. Sörensen, “The travelling salesperson problem with hotel selection,” J. Oper. Res. Soc., 2012.

M. Pourhassan and F. Neumann, “On the impact of local search operators and variable neighbourhood search for the generalized travelling salesperson problem,” in GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference, 2015.

V. Raman and N. Singh Gill, “Review of different heuristic algorithms for solving Travelling Salesman Problem,” Int. J. Adv. Res. Comput. Sci., 2017.

M. Çelik and H. Süral, “Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic,” Int. J. Prod. Res., 2019.

R. Dewil, P. Vansteenwegen, and D. Cattrysse, “Construction heuristics for generating tool paths for laser cutters,” Int. J. Prod. Res., 2014.

K. R. Baker, “Solving sequencing problems in spreadsheets,” Int. J. Plan. Sched., 2011.

A. Sahalot and S. Shrimali, “a Comparative Study of Brute Force Method, Nearest Neighbour and Greedy Algorithms To Solve the Travelling Salesman Problem,” Int. J. Res. Eng. Technol., 2014.

M. Kyritsis, G. Blathras, S. Gulliver, and V. A. Varela, “Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem,” Heliyon, 2017.

B. Ahmed, S. Singh Chouhan, S. Biswas, P. Gayathri, and H. Santhi, “Analysis of travelling salesman problem,” in IOP Conference Series: Materials Science and Engineering, 2017.

R. Salman, J. S. Carlson, F. Ekstedt, D. Spensieri, J. Torstensson, and R. Söderberg, “An Industrially Validated CMM Inspection Process with Sequence Constraints,” in Procedia CIRP, 2016.

Z. Kashino, G. Nejat, and B. Benhabib, “A multi-robot sensor-delivery planning strategy for static-sensor networks,” in IEEE International Conference on Intelligent Robots and Systems, 2017

Published
2019-10-23
Section
Articles