Perbandingan Algoritma A* Dengan Algoritma Greedy Pada Penentuan Routing Jaringan

CCIT Journal ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 158-169
Author(s):  
Lukman Lukman ◽  
Rahmat Hidayat ◽  
Muhammad Fachrul Risqi Pribadi
Keyword(s):  
Greedy Algorithm ◽  
Routing Protocol ◽  
Network Flow ◽  
Model Comparison ◽  
Search Algorithm ◽  
The Internet ◽  
Shortest Route ◽  
On Line ◽  
Network Flow Optimization

The increasing development of the Internet today is in line with the complexity of on line on the internet. So the Network flow optimization became the main problems related to the election of the shortest route (routing protocol). Focus on research is to find out and compare the process with the shortest route in the search algorithm is Greedy algorithm and A * in order to reduce the workload of the network. Model comparison algorithm that is done is look at the workings of each algorithm against the determination of the routing path from the sender to the receiver. On the basis of the implementation of the experiment it was found that the algorithm a * greedy algorithm finds its way with the same. but it is clear for the a * would be more effective if applied on a broad network as well as complicated. Because the calculation uses a * definite while greedy simply looked at what is the most short front side towards the next node that was selected when the end result can be greater than the calculation of a

scholarly journals Simulasi Algoritma A* Dan Dijkstra Pada WAN

2017 ◽  
Vol 12 (2) ◽  
pp. 112
Author(s):  
Fachrian Anugerah ◽  
Nania Nuzulita ◽  
Almira Syawli
Keyword(s):  
Routing Protocol ◽  
Network Flow ◽  
Flow Optimization ◽  
Fiber Link ◽  
Network Flow Optimization

Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan rute terpendek (routing protocol) di balik kompleksitas jalur pada WAN. Algoritma yang digunakan pada routing protocol dirancang untuk memiliki kemampuan pencarian rute terpendek. Dengan perkembangan berbagai algoritma saat ini, apakah algoritma penentuan rute terpendek pada graf seperti A* dapat diterapkan untuk penentuan rute terpendek pada jaringan. Fokus pada penelitian ini yaitu mengetahui dan membandingkan proses komputasi dalam pencarian rute terpendek dengan algoritma Dijkstra dan algoritma A* guna mengurangi beban kerja jaringan. Penelitian dilakukan dengan simulasi pada topologi mesh yang menggunakan fiber link. Berdasarkan hasil simulasi dapat diketahui bahwa algoritma A* memiliki proses komputasi yang lebih sedikit dan jarak yang dihasilkan lebih pendek dibandingkan dengan algoritma Dijkstra. Oleh karena itu, algoritma A* dapat dipertimbangkan sebagai algoritma pada routing protocol.

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

2021 ◽  
Vol 8 (1) ◽  
pp. 33-42
Author(s):  
Sularno Sularno ◽  
Dio Prima Mulya ◽  
Renitra Astri ◽  
Dwiki Mulya
Keyword(s):  
Search Algorithm ◽  
Safe Zone ◽  
Educational Process ◽  
Web Based ◽  
Community Needs ◽  
Shortest Route ◽  
Sense Of Security ◽  
Shortest Distance ◽  
Starting Point

Purus village in Padang City which has an area of 0.86 km2 consisting of 8 RW and 28 RT has a population of 8,075 people with a density of 11,875. As a result, people are always haunted by fear and always feel threatened if an earthquake occurs. If an earthquake and tsunami occur, what the community needs at that time is information about a safe zone that can be reached to save themselves and their families. For this reason, there needs to be an educational process for the community so that they have a culture of disaster awareness in the form of a system that is able to inform the community where the closest safe zone they can reach is the route they must take when a disaster strikes so that it can provide a sense of security because of safety guarantees. This study aims to determine the shortest route that can be taken by the user (community) during a disaster to reduce the risk of a greater number of victims by using the Breadth first search algorithm which is integrated into a web-based GIS application. By determining the starting point which is the user's position when the disaster occurs, and then determining the end point which is the location of the closest shelter, it will be possible to calculate the shortest distance that can be reached by the user at that time. The method chosen in this study is a waterfall because each step of the research carried out must be sequential and structured to avoid the risk of errors in each sequence of processes carried out. The results of this study can be proven by doing manual calculations to determine the shortest distance which will later be compared with the results of applications that have been designed using the BFS algorithm.

scholarly journals SIMULASI ALGORITMA A* DAN DIJKSTRA PADA WAN

2017 ◽  
Author(s):  
Fachrian Anugrah ◽  
Nania Nuzulita ◽  
Almira Syawli
Keyword(s):  
Routing Protocol ◽  
Network Flow ◽  
Flow Optimization ◽  
Fiber Link ◽  
Network Flow Optimization

Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan rute terpendek (routing protocol) di balik kompleksitas jalur pada WAN. Algoritma yang digunakan pada routing protocol dirancang untuk memiliki kemampuan pencarian rute terpendek. Dengan perkembangan berbagai algoritma saat ini, apakah algoritma penentuan rute terpendek pada graf seperti A* dapat diterapkan untuk penentuan rute terpendek pada jaringan. Fokus pada penelitian ini yaitu mengetahui dan membandingkan proses komputasi dalam pencarian rute terpendek dengan algoritma Dijkstra dan algoritma A* guna mengurangi beban kerja jaringan. Penelitian dilakukan dengan simulasi pada topologi mesh yang menggunakan fiber link. Berdasarkan hasil simulasi dapat diketahui bahwa algoritma A* memiliki proses komputasi yang lebih sedikit dan jarak yang dihasilkan lebih pendek dibandingkan dengan algoritma Dijkstra. Oleh karena itu, algoritma A* dapat dipertimbangkan sebagai algoritma pada routing protocol.

scholarly journals Penentuan Rute Terpendek Pendistribusian Tabung Gas Lpg 3 Kg Pt. Fega Gas Palu Pratama Menggunakan Algoritma Tabu Search

2020 ◽  
Vol 16 (2) ◽  
pp. 221-229
Author(s):  
Riswan ◽  
A Sahari ◽  
D Lusiyanti
Keyword(s):  
Tabu Search ◽  
Nearest Neighbor ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Termination Criteria ◽  
Shortest Route ◽  
Tabu Search Method ◽  
Optimum Solution ◽  
Gas Cylinders

ABSTRACTDistribution is one of the important tools in the company business activities. The problem that is often occurred indistribution is the determination of the shortest route. The purpose of this study is optimitation distribution route of3 kg LPG gas cylinders which is carried out by PT. Fega Gas Palu Pratama in Palu City, considering that thiscompany has not used a particular method in determining the distribution route of 3 kg LPG gas cylinders. Themethod used in this study is the Tabu Search algorithm. The algorithm of the Tabu Search method are of follows,first by determine the initial solution using the closest Nearest Neighbor, determine alternatives by exchange 2points in the solution, evaluate alternative solutions, determine a new optimum solution, update the Tabu List, thenwhen the termination criteria are obtained then the Tabu Search algorithm will stop otherwise it will revert toexchanging 2 points evaluation. The process of calculating the Tabu Search algorithm is conducted manually andbuilt using MATLAB. Based on the research that has been done, it is obtained that the shortest, more efficient routeis 21.91 km which has reduction of 7.26 km from the initial route 29.17 km.Keywords : Algorithm Tabu Search, Distribution, Shortest Route.

Fast calibration of CBED patterns for quantitative analysis

1993 ◽  
Vol 51 ◽  
pp. 674-675
Author(s):  
M.A. Gribelyuk ◽  
M. Rühle
Keyword(s):  
Reciprocal Lattice ◽  
Accurate Determination ◽  
Incident Beam ◽  
Crystal Thickness ◽  
Structure Model ◽  
Beam Direction ◽  
Transmitted Beam ◽  
Reciprocal Vector ◽  
On Line

A new method is suggested for the accurate determination of the incident beam direction K, crystal thickness t and the coordinates of the basic reciprocal lattice vectors V1 and V2 (Fig. 1) of the ZOLZ plans in pixels of the digitized 2-D CBED pattern. For a given structure model and some estimated values Vest and Kest of some point O in the CBED pattern a set of line scans AkBk is chosen so that all the scans are located within CBED disks.The points on line scans AkBk are conjugate to those on A0B0 since they are shifted by the reciprocal vector gk with respect to each other. As many conjugate scans are considered as CBED disks fall into the energy filtered region of the experimental pattern. Electron intensities of the transmitted beam I0 and diffracted beams Igk for all points on conjugate scans are found as a function of crystal thickness t on the basis of the full dynamical calculation.

A hitchhiker’s guide to microscopy and microanalysis using telecommunications, e-mail, and the Internet

1994 ◽  
Vol 52 ◽  
pp. 390-391 ◽  
Author(s):  
Nestor J. Zaluzec
Keyword(s):  
The Internet ◽  
Information Superhighway ◽  
The World ◽  
Exchange Information ◽  
On Line ◽  
Computer Based ◽  
Software And Hardware ◽  
Communication Software ◽  
Basic Ideas ◽  
E Mail

The Information SuperHighway, Email, The Internet, FTP, BBS, Modems, : all buzz words which are becoming more and more routine in our daily life. Confusing terminology? Hopefully it won't be in a few minutes, all you need is to have a handle on a few basic concepts and terms and you will be on-line with the rest of the "telecommunication experts". These terms all refer to some type or aspect of tools associated with a range of computer-based communication software and hardware. They are in fact far less complex than the instruments we use on a day to day basis as microscopist's and microanalyst's. The key is for each of us to know what each is and how to make use of the wealth of information which they can make available to us for the asking. Basically all of these items relate to mechanisms and protocols by which we as scientists can easily exchange information rapidly and efficiently to colleagues in the office down the hall, or half-way around the world using computers and various communications media. The purpose of this tutorial/paper is to outline and demonstrate the basic ideas of some of the major information systems available to all of us today. For the sake of simplicity we will break this presentation down into two distinct (but as we shall see later connected) areas: telecommunications over conventional phone lines, and telecommunications by computer networks. Live tutorial/demonstrations of both procedures will be presented in the Computer Workshop/Software Exchange during the course of the meeting.

Opening New Worlds of Information: Library Technology and Internet Access for Patrons with Disabilities

2013 ◽  
Author(s):  
Courtney Deine-Jones
Keyword(s):  
Internet Access ◽  
The Internet ◽  
Electronic Information ◽  
On Line ◽  
Remote Sites ◽  
Technological Improvements ◽  
Library Technology

As more libraries offer patron access to the Internet and other on-line services, they must consider the needs of patrons with disabilities who will be using their Internet links either from the library or from remote sites. In planning and implementing technological improvements to optimize access for all patrons, librarians and information specialists must take into account questions of both physical and intellectual access to electronic information. This paper addresses these issues from a pragmatic perspective, reviewing available options and suggesting strategies for improving access for people with various disabilities.

Determination of Optimal Public Transportation Routes Using Firefly and Tabu Search Algorithms

2020 ◽  
Vol 4 (5) ◽  
pp. 884-891
Author(s):  
Salwa Salsabila Mansur ◽  
Sri Widowati ◽  
Mahmud Imrona
Keyword(s):  
Tabu Search ◽  
Public Transportation ◽  
Traffic Congestion ◽  
Search Algorithm ◽  
Urban Transportation ◽  
The Public ◽  
Comparison Results ◽  
Congestion Problems ◽  
Transportation Routes

Traffic congestion problems generally caused by the increasing use of private vehicles and public transportations. In order to overcome the situation, the optimization of public transportation’s route is required particularly the urban transportation. In this research, the performance analysis of Firefly and Tabu Search algorithm is conducted to optimize eleven public transportation’s routes in Bandung. This optimization aims to increase the dispersion of public transportation’s route by expanding the scope of route that are crossed by public transportation so that it can reach the entire Bandung city and increase the driver’s income by providing the passengers easier access to public transportations in order to get to their destinations. The optimal route is represented by the route with most roads and highest number of incomes. In this research, the comparison results between the reference route and the public transportation’s optimized route increasing the dispersion of public transportation’s route to 60,58% and increasing the driver’s income to 20,03%.

Sign in / Sign up

Export Citation Format

Share Document