Geographic Information System for Booking Beauty Salon and Barber Shop with an Android-Based E-CRM Approach

Abstract

Beauty salons and barber shop are a necessity for almost everyone. Nowadays, the business processes of them mostly still use conventional methods. The method gives obstacles to customers who have a lot of activities, for example, they have to come directly to the beauty salon or barber shop to take the queue. In addition, it is hard to promote, communicate and assess without E-CRM media. The location is also difficult to find because there is no guide mark on Google Maps. The Geographic Information System for Booking Beauty Salon and Barber Shop provides solutions for making scheduled bookings and transactions by using the e-CRM approach as in the application of promotional features to attract customers. There are some features offered in the application, such as chat features for communication, rating and review features to assess the services obtained, and route feature as a solution to show the location of selected vendors. The implementation process requires an Android smartphone and a computer device with software including Android Studio, SQLYog, XAMPP, and Visual Studio Code. The results of the implementation is the system can be successfully applied based on experiments and testing directly.

Determination of The Shortest Route Based on BFS Algorithm for Purpose to Disaster Evacuation Shelter

“…The basic capabilities of GIS are to integrate various database operations such as queries, analyze them and display them in the form of mappings based on their geographic location. This is what distinguishes GIS and other information systems [2].…”

“…By implementing the Breadth First Search (BFS) algorithm integrated into this GIS web-based application, it can save travel time by knowing the shortest route to reach the shelter point. There are currently many activities in the field using a Global Positioning System (GPS), Laptop, and GIS software to perform mappings in real-time [2]. Breadth first search algorithm is an algorithm that performs a widened search that visits a vertex by preorder, which is to visit a node and then visit all the neighboring vertices on that node first.…”

“…The results of this study also allow ordering data to be sent over a wireless network that connects smartphones to computers in the kitchen. As a result, the order can be directly read by the chef because it is shown on the LCD screen [2].…”