Open AccessThe Object Tracking System At The Service Delivery Center Of The Traveling Salesperson Problem Method
Author(s) -
Richki Hardi,
Nanna Suryana,
Naim Che Pee,
Agung Sakti Pribadi,
Jack Febrian Rusdi,
Apri Junaidi
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1807/1/012034
Subject(s) - shortest path problem , computer science , path (computing) , object (grammar) , point (geometry) , service (business) , operations research , travelling salesman problem , mathematical optimization , real time computing , computer network , mathematics , artificial intelligence , algorithm , marketing , business , theoretical computer science , graph , geometry
Search object delivery is essential to investigate, especially for package delivery. The technology is beneficial to check whether the goods sent have arrived or not. Otherwise, it will be known where in real-time. This study aims to provide information to the shipping service, to choose the right and optimal shipping routes using the problem of the Travel Salesperson’s problem, because of that way. This method is rather difficult when viewed from a computational point of view, but TSP is made easy by trying all possible routes to get a solution or approaching the optimal path. The problem is how to determine the route according to the package that can get to the destination city in the shortest time possible by using that route, package which can reach a town or delivery center to each subsequent branch that matches the package to the postal receiving town with a minimum time limit. In other words, the shortest path and the path that the packet must pass from the sending post to the recipient must be determined.