scholarly journals IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN JALUR TERPENDEK DALAM DISTRIBUSI BARANG

2021 ◽  
Vol 2 (2) ◽  
pp. 194-203
Author(s):  
Ikhsan Baharudin ◽  
Ahmad Jaka Purwanto ◽  
Teguh Rahayu Budiman ◽  
Muchammad Fauzi
Keyword(s):  
Shortest Path ◽  
Manufacturing Industry ◽  
Optimal Path ◽  
Transportation Costs ◽  
Project Work ◽  
Shortest Route ◽  
Regular Customer ◽  
Shortest Distance ◽  
The Cost ◽  
A Company

PT. X is a company domiciled in Gedebage, Bandung which is engaged in the manufacturing industry by producing precision parts using CNC machines. PT. X is a sub-contracting company that usually serves project work from other companies. PT. Y and PT. Z is a regular customer who often works with PT. X. So that PT. X often sends finished products directly to PT. Y who is domiciled on Jl. Gatot Subroto, Bandung and also PT. Z who is domiciled on Jl. Pajajaran, Bandung. To minimize the cost of distribution of goods, PT. X must determine an adequate path taking into account the optimization of transportation costs. One of the variables that affect transportation costs is distance. It is assumed that the optimal path for transportation costs is the shortest distance using the Dijkstra method. This test uses data from Google Maps to find out the distance to each destination, making it easier to get the shortest path. Obtained the shortest path from PT. X to PT.Y is 12.3 Km via West Java Police then Carefour, while the shortest route is from PT. Y to PT. Z is 10.7 Km via Simpang Lima then Vie Hotel Westhoff. So that the optimal total mileage for distributing goods is 23 Km.

scholarly journals MENENTUKAN RUTE TERPENDEK DENGAN MENGGUNAKAN ALGORITMA FLOYD-WARSHALL DALAM PENDISTRIBUSIAN BARANG PADA PT. RAPY RAY PUTRATAMA

2018 ◽  
Vol 4 (1) ◽  
Author(s):  
M Ridwan Mukti ◽  
Mulyono . .
Keyword(s):  
Shortest Path ◽  
Minimum Distance ◽  
Shortest Path Problem ◽  
Search Result ◽  
Shortest Route ◽  
Shortest Distance ◽  
Path Search ◽  
Distance Data ◽  
Shortest Path Search ◽  
Route Search

ABSTRAKMasalah pendistribusian pada perusahaan adalah masalah yang sangat penting untuk diperhatikan. Pada dasarnya pendistribusian barang akan sangat menghemat perusahaan dalam berbagai hal.Pencarian rute terpendek yang dilakukan pada PT. Rapy Ray Putratama Medan dilakukan dengan menghubungkan berbagai macem outlet dan juga termasuk beberapa outletnya adalah PT. Rapy Ray Putratama cabang medan. Permasalah rute terpendek ini dapat disesaikan dengan menggunakan salah satu metode pencarian rute terpendek yaitu algoritma Floyd-Warshall. Penelitian ini bertujuan untuk mengetahui hasil dari rute yang akan dipilih sebagai saran atau masukan kepada Perusahaan. Untuk hasil pencarian rute terpendek dengan menggunakan algoritma Floyd-Warshallyang diimplementasikan dalam pemrograman Codeblocks:: adalah jarak dari PT ke outlet maupun dari outlet ke outlet memiliki jarak yang paling minimum. Setelah itu, dapat ditentukan rute terpendek yang akan dipilih oleh salesman dalam pendistribusian yang telah didapatkan pada program tersebut. Data yang diinput adalah data jarak. Output yang dihasilkan program adalah jarak terpendek. Dengan penghematan jarak yang telah dilakukan. Pembentukan rute usulan yang dihasilkan dengan menggunakan metode algoritma Floyd-Warshall menghasilkan rute yang lebih dekat dengan total jarak penghematan adalah 10.97 % (51.304 km).Kata kunci: Pendistribusian, Pencarian rute terpendek, algoritma Floyd-Warshall. ABSTRACTThe problem of distribution to the company is a very important issue to notice. Basically the distribution of goods will greatly save the company expense in various ways. The searching for the shortest route done at PT. Rapy Ray Putratama Medan conducted by connecting various kinds of outlets and also including some outlets at PT. Rapy Ray Putratama Medan branch. This shortest path problem can be solved by using one of the shortest path search methods the Floyd-Warshall algorithm. This study aims to determine the results of the route to be selected as advice or input to the company. For the shortest route search result using Floyd-Warshall algorithm implemented in codeblocks programming is the distance from PT. Rapy Ray Putratamata outlet and from outlet to outlet which has the minimum distance. Subsequently, it can be determined the shortest route that will be selected by the salesman in the distribution that has been attained on the program. The inputted data is the distance data. The output produced by the program is the shortest distance by saving the distance that has been done through the algorithm. The proposed route formatted using the Floyd-Warshall algorithm method resulted in a route closer to the total distance of a saving distance of 10.97% (51,304 km). Keywords: Distribution, the shortest path searching, Floyd-Warshall algorithm.

scholarly journals A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

2020 ◽  
Vol 16 (1) ◽  
pp. 65-70
Author(s):  
Siti Lestari Lestari ◽  
Ardiansyah Ardiansyah ◽  
Angelina Puput Giovani ◽  
Desy Dwijayanti
Keyword(s):  
Artificial Intelligence ◽  
Problem Solving ◽  
Shortest Path ◽  
Rapid Development ◽  
Residential Area ◽  
Daily Activities ◽  
Dijkstra Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Algorithm Implementation

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

scholarly journals Multi-Objective Shortest Path Model for Optimal Route between Commercial Cities on America

2019 ◽  
pp. 1394-1403
Author(s):  
Mohammed S. Ibrahim
Keyword(s):  
Shortest Path ◽  
Transportation Network ◽  
Optimal Path ◽  
Path Model ◽  
Multi Objective ◽  
Proposed Model ◽  
Shortest Distance ◽  
Lexicographic Method ◽  
Package Program ◽  
Us Cities

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operational research applications.

scholarly journals Dijkstra Algorithm Application: Shortest Distance between Buildings

2018 ◽  
Vol 7 (4.10) ◽  
pp. 974 ◽  
Author(s):  
G. Deepa ◽  
Priyank Kumar ◽  
A. Manimaran ◽  
K. Rajakumar ◽  
V. Krishnamoorthy
Keyword(s):  
Shortest Path ◽  
Engineering Calculation ◽  
Destination Node ◽  
Efficiency Improvement ◽  
Storage Space ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Basic Concepts

The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve. 

TDABC for a manufacturing environment: A case study

Tékhne ◽  
2018 ◽  
Vol 16 (2) ◽  
pp. 2-10
Author(s):  
Ashwin B. Ganorkar ◽  
Ramesh R. Lakhe ◽  
Kamalkishor N. Agrawal
Keyword(s):  
Manufacturing Industry ◽  
Small Scale ◽  
Manufacturing Companies ◽  
Activity Based Costing ◽  
Product Cost ◽  
Costing System ◽  
Traditional Costing ◽  
The Cost ◽  
A Company

Abstract Costing system is an essential part of a company. Determining the accurate cost of a product or service is extremely important for the profitability and performance of a company. Over the years, different approaches and models have been developed to estimate the cost of the product manufactured. However, their models were found to be inadequate in the correct value of the product cost. In the last decade, activity-based costing (ABC) has been successfully adopted by many companies worldwide. Nonetheless, because of its high maintenance and setup cost, it has been abandoned and a new time-driven activity-based costing (TDABC) model has been developed. Though adopted by many large scale-manufacturing industries, TDABC has not been implemented in small scale manufacturing companies due to unavailability of resources and also ignorance about its implementation. This paper presents a model for the application of TDABC in the small scale manufacturing industry. The model is implemented in a furniture manufacturing company for the estimation of product cost. The cost obtained from the TDABC is compared with the traditional costing system and established the accuracy of TDABC over the traditional costing system. Along with the case study, this paper also discusses the different data results obtained from TDABC and its utility for the managers and the decision makers.

scholarly journals Quality improvement in readymade garments industry by traffic light system

2020 ◽  
Vol 6 (3) ◽  
Author(s):  
Halima Tus Sadia ◽  
MD Faisal Hanif ◽  
Mehedi Hasan Chaion ◽  
Mohammad Abu Sayed Rafi ◽  
MD Jamir Uddin ◽  
...  
Keyword(s):  
Manufacturing Industry ◽  
Minimum Cost ◽  
Project Work ◽  
Traffic Light ◽  
Light System ◽  
System A ◽  
Average Defect ◽  
The Cost ◽  
Garment Manufacturing

Consumers, manufacturers, and retailers worldwide are becoming conscious about high quality products at minimum cost. But plenty of apparels are becoming waste which increases the cost of production. As resources are decreasing but increasing costs of the products. Effective apparel waste management is needed to ensure the profit. Reducing such waste can be profitable options for the manufacturers as well as the buyers. Considering this matter, a project work is done in a ready-made garment manufacturing industry to improve the quality of the products through using a traffic light system. A traffic light system was implemented to minimize the defect rates of production. The study shows that the average defect rates were dropped from 4.13 to 1.25 pieces of a line for daily eight hours of production. By implementing this system, the defect rates are minimized and the monthly production is also increased and it clearly depicts that the monthly capacity before implementing the traffic light system was equivalent but the defective production was more whereas, after implementation, the defective production was negligible.

scholarly journals Mehar Approach for Finding Shortest Path in Supply Chain Network

2021 ◽  
Vol 13 (7) ◽  
pp. 4016
Author(s):  
Tanveen Kaur Bhatia ◽  
Amit Kumar ◽  
Srimantoorao S. Appadoo ◽  
Yuvraj Gajpal ◽  
Mahesh Kumar Sharma
Keyword(s):  
Shortest Path ◽  
Fuzzy Numbers ◽  
New Approach ◽  
Shortest Path Problems ◽  
Shortest Distance ◽  
Lexicographic Method ◽  
Different Types ◽  
The Cost ◽  
Pythagorean Fuzzy Numbers ◽  
Interval Valued

The aim of each company/industry is to provide a final product to customers at the minimum possible cost, as well as to protect the environment from degradation. Ensuring the shortest travel distance between involved locations plays an important role in achieving the company’s/industry’s objective as (i) the cost of a final product can be minimized by minimizing the total distance travelled (ii) finding the shortest distance between involved locations will require less fuel than the longest distance between involved locations. This will eventually result in lesser degradation of the environment. Hence, in the last few years, various algorithms have been proposed to solve different types of shortest path problems. A recently proposed algorithm for solving interval-valued Pythagorean fuzzy shortest path problems requires excessive computational efforts. Hence, to reduce the computational efforts, in this paper, firstly, an alternative lexicographic method is proposed for comparing interval-valued Pythagorean fuzzy numbers. Then, using the proposed lexicographic comparing method, a new approach (named as Mehar approach) is proposed to solve interval-valued Pythagorean fuzzy shortest path problems. Furthermore, the superiority of the proposed lexicographic comparing method, as well as the proposed Mehar approach, is discussed.

Identyfikacja kosztów pogorszenia reputacji przedsiębiorstwa z perspektywy interesariuszy

2014 ◽  
pp. 10-15
Author(s):  
Danuta Szwajca ◽  
Alina Rydzewska ◽  
Tomasz Nawrocki
Keyword(s):  
Cost Analysis ◽  
Economic Costs ◽  
Crisis Situation ◽  
Modern Economy ◽  
The Cost ◽  
A Company ◽  
Crisis Situations

In the realities of modern economy even the best-managed company is not able to avoid threats and bad decisions, that can cause a crisis. Each crisis situation, that a company experiences, generates not only measurable economic costs, but also more difficult to assess and measure costs of a deteriorated reputation. These costs are the result of infringement of interests or failing to satisfy different stakeholders expectations. The aim of this article is an attempt to identify the cost of reputation deterioration in the context of the various interests of stakeholders groups. In the first part, the paper presents the effects of good and bad reputation, the reputation "contamination" path in a crisis situation and a cost analysis caused by it. The second part is empirical, where the identification of crisis situations measurable costs and reputation deterioration based on the examples of three selected companies was performed.

PERBAIKAN TATA LETAK LANTAI PRODUKSI INDUSTRI MEBEL MENGGUNAKAN METODE GRAFIK DAN ALGORITMA CRAFT

2020 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
Kuswanto Kuswanto ◽  
Juan Junius ◽  
Anita Christine Sembiring
Keyword(s):  
Operating System ◽  
Material Handling ◽  
Facility Layout ◽  
Integrated Planning ◽  
Furniture Manufacturing ◽  
Milling Machines ◽  
Material Handling Costs ◽  
The Cost ◽  
A Company ◽  
Research Show

Facility layout is integrated planning of the flow of a product in an operating system to obtain the most effective and efficient interrelation between workers, materials, machinery, and equipment as well as handling and transferring materials. A company engaged in furniture manufacturing has a problem in its production process, namely, the distance between machines is too far so that it affects the cost of handling materials. Distant workstations are found on profile machines, milling machines, measuring machines, cutting machines. Therefore, improvements must be made to the layout of facilities on the production floor so that facility layout is efficient and material handling costs are reduced. The problem-solving approach used is the Graph Method and CRAFT Algorithm. The results of the research show that material handling costs are reduced by 7.58% or Rp. 17,765 using the CRAFT algorithm.

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.

Sign in / Sign up

Export Citation Format

Share Document