MOBILE APPLICATION SEARCHING OF THE SHORTEST ROUTE ON DELIVERY ORDER OF CV. ALFA FRESH WITH BRUTE FORCE ALGORITHM

Traveling Salesman Problem is a problem solving used in finding the shortest route to visit all nodes at once and then return to the initial node. Troubleshooting of the Traveling Salesman Problem using the Brute Force algorithm. The object of this research is the courier at CV. Alfa Fresh. The Brute Force algorithm provides a solution for Traveling Salesman Problems to select and determine the shortest routes to deliver orders from the office to the destination. Methode The Brute Force algorithm is methode an algorithm that is used to match patterns with all routes to be traversed to find the shortest route pattern. Result in reseach is the Brute Force algorithm works by enumerating all possible candidates. With this application can facilitate the courier in determining the closest route from the position of the courier. This application can also be a note for the courier to see what order he did. The brute force algorithm can give the shortest route from the courier position well, but the calculation process is a little slower because the algorithm calculates all possible distances.


INTRODUCTION
CV. Alfa Fresh is an Indonesian company that provides purchasing services for online kitchen needs such as selling fruits, vegetables, meat and other kitchen spices. CV. Alfa Fresh was founded in 2017 in the city of Palembang. This company provides Web and Mobile based applications for marketing. CV. Alfa Fresh itself has many employees with various kinds of parts, one of which is courier. Courier in CV. Alfa Fresh is in charge of delivering orders as well as to other companies, couriers who help buyers to deliver their orders who ordered online.
Couriers visit the place of the customer, where the place or destination of the courier not only one place but several places each day according to the order received. And only need to be delivered once for each customer. If there are 5 places / destinations to be visited by the courier, then there are several routes that may be passed. This causes the courier to be able to arrange the order of his visit in order to get the most effective distance possible. The problem that often occurs is that couriers sometimes forge distances that are too far and too swirling to visit one place to another, this causes couriers to be less efficient in visiting the order in which they want to go.
Resolving the problem of traveling salesman problems can be applied to visiting a number of places. To solve this problem there are various methods that can be used, one of them is by using the Brute Force algorithm. The Brute Force algorithm is an algorithm that is used to match patterns with all routes that will be passed to find The optimal route pattern. Brute Force is a very common problem solving technique and can be used to solve problems by finding the shortest route. Brute Force works by enumerating all possible candidates, giving the best solution. The shortest route is a problem to find a path between two or more vertices in a graph weighted with the minimum number of graph side weights crossed. In weighted graphs there are optimizations that can be expressed in distances between cities, message delivery times, costs and so on. In this case the weight must be p-ISSN : 1412-114X e-ISSN : 2580-5649 http://ojs.pnb.ac.id/index.php/LOGIC positive, although in other cases it can be negative. The shortest path with the initial vertex s and vertex t destination is defined as the shortest path from s and t with minimum weight and in the form of a simple path [1]. What is done in TSP is forming a travel route. The operator that can be used for Travelling Salesman Problem (TSP) problems is the search for sequences of all locations to select locations that have not been selected one by one so that a complete route of visit is generated from the initial location then visits all other locations exactly once and finally returns to the original location [2].
TSP is divided into 2 types, namely: (1) Asymmetrical TSP, this type of Asimetirs TSP, the cost from city 1 to city 2 is not the same as the cost from city 2 to city 1, with n cities, the size of the search space is a possible path; (2) symmetrical TSP, the type of Symmetrical TSP, the cost from city 1 to city 2 is the same as the cost from city 2 to city 1. If with n cities, the number of possible routes is a possible path.
The Brute force method is a direct approach to solving a problem, which is based on problem statements and defines the concepts involved directly. Troubleshooting using the Brute force Method is very simple, direct and clear. Characteristics of the Brute force method: (1) The number of steps needed is large, (2) Used as a basis for finding a more efficient or creative solution, (3) Almost all problems can be solved by this method, (4) Used as a basis in comparing the quality of an algorithm [3].
Exhaustive search is a brute force solution search technique for problems that involve finding elements with special properties. Usually between combinatory objects such as permutations, combinations, or subsets is part of a set [4]. The use of Brute force on TSP problems can be illustrated as follows: Given many (n) destinations in a city and the distance between each city is known to each other. Find the shortest tour through every other city only once and return to the city from departure. This TSP problem is nothing but finding a Hamilton circuit with a minimum weight. Exhaustive search technique steps: (1) Make a list (Enumeration) of every possible solution in a systematic way, (2) Evaluate each possible solution one by one, especially the mirror solution, can be issued. Then save the best solution to date (3) After the search ends, announce the best solution, (4) The resources needed in finding solutions using Exhaustive Search are very large, although the exhaustive technique theoretically produces a solution.
In order for the mobile application to be utilized by the courier at the company, mobile applications that can replace orders based on the customer's address is needed, then determine the order of the shortest route to be traversed from the data that has been collected. For this reason, research was carried out on Mobile Application Searching of the Shortest Route on Deliver Order of CV. Alfa Fresh with the Brute Force Algorithm. The Mobile Application is expected to help the courier officer on the CV. Alfa Fresh to determine the shortest route to visit customers so that it can shorten the distance traveled and save time.
This study focuses on the analysis, design, and development of EzDelivery which implements the Held-Karp and Fixed-Radius Near Neighbors algorithm (Castillo, Reynaldo E.Agustin, et al : 2019). The fixed-radius near neighbors algorithm is used to find the closest company because of its effectiveness in achieving mobile application functionality.

Stage of Research Problems
This stage is the process of formulating problems and limiting the problems to be studied. This is needed in order to be able to better direct the researcher in making the application so that what is done is not out of the predetermined limits.

Data Collection
In this data collection stage the author refers to opinions [5], where the opinions explain the stage of data collection which is divided into two types, namely: 1. Primary Data Primary data is data that was first recorded and collected in the study. Primary data where the author conducts a survey directly to the party concerned, namely the party that has the authority to collect the data. The author conducted interviews and observations with employees of CV. Alfa Fresh Palembang. The interview produced an obstacle faced by the CV. Alfa Fresh Palembang where the courier as the delivery order to the customer is still constrained in determining the most effective route to deliver orders to customers, so that the time of shipping orders is still less effective.

Secondary Data
Secondary data is data collected from existing sources. Here, here the author collects data indirectly, namely by searching for information through research journals, books, and other document sources, as a reference for the construction of mobile applications that will be made.

Research Design
In doing this final project, the system design used includes usecase diagrams, activity diagrams, class diagrams, and sequence diagrams.

Completion of the Brute Force Algorithm With Exhaustive Search Technique On Traveling Salesman Problem
An example of a case study of the application of a brute force algorithm with the Exhaustive Search technique on the Traveling Salesman Problem itself is as follows, with a starting position at CV.Alfa Fresh then the first point to Jalan Putri Rambut Selako no.4 Ilir barat 1, second point Jalan Joko No. 10 Small hill, and third point Jalan Bali Blok C3 Complex Pusri Borang Sako then return to CV. Alfa Fresh. First, look for the distance between the starting positions to the destination with the euclidean distance calculation formula, namely: Information " = Coordinate x for initial point i (latitude) " = Coordinate y for destination point j (longitude) "# = Distance between two points i and j Looking for the distance between the initial start, namely CV. Alfa Fresh to the destination Jalan Putri Rambut Selako No. 4 Ilir barat 1 (A-B) with the following formula : So the calculation of the exhaustive search technique above can be done to repair the number of route searches, namely by knowing that half of the travel routes are the result of reflection of the other half route, that is by changing the direction of the route, the route is: R1 dan R6 = 0.01625813417623 R2 dan R4 = 0.02375439444094 R3 dan R5 = 0.02268746835375 Then the route chosen based on the total distance of the smallest or closest is R1 and R6

System Development Method
If in making the application the author uses the Brute Force algorithm, then in developing the system the author uses the Waterfall system development method. The waterfall method is done in stages one by one starting from the top stage to the bottom stage. The stages involved include the analysis, design, coding, testing, and support phases. The waterfall development method was chosen because the application of steps in the waterfall was in accordance with the method of development carried out by the author. a. Analysis of software requirements The stage for analyzing the needs of external devices is the process of gathering system requirements such as Android Studio for editors coding applications; Sublime Text is useful to encode the web, MySql to store databases, PHP to encode php programs. b. Design The design stage is a needs analysis of system design software in use case diagrams, activity diagrams, class diagrams, and sequence diagrams. c. Program code creation The stage of making the program code is the process of doing coding system (Encoding Software) on Android Studio and Sumbile Text by the Programmer in accordance with the analysis and design stages that have been made before. d. Testing The testing phase of the author uses the Black Box method, testing is done to find out whether the system is running well and not. In conducting testing the author makes a test plan as a reference in conducting testing. e. Support or maintenance This maintenance stage checks the application system if there is a mistake, the application will be corrected.

System Requirements Analysis a. Functional Requirements
Rosa and Shalahudin [6], Explain functional requirements is a need related to product functions, for example, information systems must be able to print reports, information systems must be able to display graphics, etc.
The functional requirements of the system to be built are as follows: 1. The website and application system can authorize and authenticate users such as admin and courier. 2. The website system created can input data, edit data, and delete data in the form of admin, customer, order, order, product, user, and courier data. 3. The application system can search for the nearest route. 4. The application system can see the order history that has been completed.

b. Non Functional Requirements
Non-functional needs are additional needs that do not have inputs, processes, and outputs. However, this nonfunctional requirement should be fulfilled because it will determine whether this system will be used by the user or not. The related non-functional needs are two, namely: 1. Admin websites that will be built include: a. The website must be accessible with a browser. b. The website must be accessible to the user formulated. c. Has a friendly user interface d. The website system has a password, so only registered users can access the website.
2. Courier applications to be built include: a. The ease of use of software can be accessed anywhere and anytime through mobile-based applications. b. Safety factors related to the use of the API Key (Application Programming Interface).

System Planning a. Usecase Diagram
According to Rosa and Shalahuddin [6], use case diagram is a model for information system behavior to be created. The use case describes an interaction between one or more actors with the information system that will be created. Roughly speaking, usecase is used to find out what functions are in an information system and who has the right to use those functions.

b. Class Diagram
Rosa and Shalahudin Class diagrams illustrate the system structure in terms of defining the classes that will be made to build the system [6]. Classes have what are called attributes and methods or operations. Attributes are variables owned by a class. Whereas, operations or methods are functions that are owned by a class.

System Implementation
The following is the interface of the system application:

Figure 5 Application Login Page
On this page the courier logs in first to access this application by filling in the username and password then press the login button. If successful the courier login can access on the next page.

Figure 6 Application List Order page
This main page functions to view the list of orders and by pressing the Access button Start the Route then the courier can find out the route of the order to be followed. In addition, this page contains 3 access panels in the form of Order Lists, order history, and profiles. It is a route map page for orders that are in the application. This page will help the courier get the shortest distance route to deliver orders and be accompanied by directions to directions such as those available in Google Maps.  This page is a page that will display the profile of the messenger and there is a logout button for the courier to exit the application.

CONCLUSION AND SUGGESTIONS 4.1 Conclusion
Based on the discussion described in the previous chapters, there are several conclusions is as follows: a. With this application it can make easier for couriers to determine the closest route to the position of the courier.