Effective route analysis for petrol tanker and optimization using Dijkstra algorithm and arena simulation at Petrol Station XYZ

2021 ◽  
Author(s):  
Nurul Atiqah Mazlan ◽  
Majid Khan Majahar Ali ◽  
Mohd Tahir Ismail ◽  
Mukhtar
Keyword(s):  
Dijkstra Algorithm ◽  
Petrol Station ◽  
Arena Simulation

Implementasi Algoritma Dijkstra Pada Game Pacman

CCIT Journal ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 170-176
Author(s):  
Anggit Dwi Hartanto ◽  
Aji Surya Mandala ◽  
Dimas Rio P.L. ◽  
Sidiq Aminudin ◽  
Andika Yudirianto
Keyword(s):  
Artificial Intelligence ◽  
Greedy Algorithm ◽  
Dijkstra Algorithm ◽  
Testing Phase ◽  
A Value ◽  
Route Problem ◽  
Starting Point ◽  
The Greedy Algorithm

Pacman is one of the labyrinth-shaped games where this game has used artificial intelligence, artificial intelligence is composed of several algorithms that are inserted in the program and Implementation of the dijkstra algorithm as a method of solving problems that is a minimum route problem on ghost pacman, where ghost plays a role chase player. The dijkstra algorithm uses a principle similar to the greedy algorithm where it starts from the first point and the next point is connected to get to the destination, how to compare numbers starting from the starting point and then see the next node if connected then matches one path with the path). From the results of the testing phase, it was found that the dijkstra algorithm is quite good at solving the minimum route solution to pursue the player, namely by getting a value of 13 according to manual calculations

A Highly Efficient and Optimised Simulation Based Multi objective Decision-Making for FMS Control

2018 ◽  
Vol 6 (6) ◽  
pp. 98
Author(s):  
Shreyanshu Parhi ◽  
S. C. Srivastava
Keyword(s):  
Decision Making ◽  
Real Time ◽  
Manufacturing Industry ◽  
Simulation Software ◽  
Shop Floor ◽  
Simulation Tool ◽  
Routing Flexibility ◽  
Decision System ◽  
Multi Objective ◽  
Arena Simulation

Optimized and efficient decision-making systems is the burning topic of research in modern manufacturing industry. The aforesaid statement is validated by the fact that the limitations of traditional decision-making system compresses the length and breadth of multi-objective decision-system application in FMS.  The bright area of FMS with more complexity in control and reduced simpler configuration plays a vital role in decision-making domain. The decision-making process consists of various activities such as collection of data from shop floor; appealing the decision-making activity; evaluation of alternatives and finally execution of best decisions. While studying and identifying a suitable decision-making approach the key critical factors such as decision automation levels, routing flexibility levels and control strategies are also considered. This paper investigates the cordial relation between the system ideality and process response time with various prospective of decision-making approaches responsible for shop-floor control of FMS. These cases are implemented to a real-time FMS problem and it is solved using ARENA simulation tool. ARENA is a simulation software that is used to calculate the industrial problems by creating a virtual shop floor environment. This proposed topology is being validated in real time solution of FMS problems with and without implementation of decision system in ARENA simulation tool. The real-time FMS problem is considered under the case of full routing flexibility. Finally, the comparative analysis of the results is done graphically and conclusion is drawn.

SPACES AND “NOT-SPACES” IN THE ZHADAN’S PROSE

2019 ◽  
Author(s):  
Halyna Vypasniak
Keyword(s):  
The Novel ◽  
Main Attention ◽  
Petrol Station ◽  
Past Time ◽  
Native Group ◽  
The City

The paper analyses the symbolic features of spaces of Serhiy Zhadan’s prose. The main attention is paid to the novel “Voroshylovhrad” and the name of the city that doesn’t exist on the geographic maps anymore. Most spaces, such as a petrol station or abandoned airfield, could be defined as non-places (the term of M. Auge). For M. Auge it’s a type of space that shows the hybridity of our life. It’s basically the transit places. That is why there are no emotions connected with those non-places: no special stories, no narrative, that could create the place itself. The analysed novel by Serhiy Zhadan assures that even those places that weren’t noticed by most people and were treated by them as non-places, were really precious for others because of their personal memories and their past time, spent there. The paper also analyses the special features of the novel according M. Auge’s term the “anthropologic place”. It’s a place that represents an identity of native group that used to live there and shows the power of a connection between the place and its inhabitants. It’s also a place, where they can feel themselves and make their own rules. Those things make places like the petrol station, worth to be defended from intrusions.

scholarly journals Exploring a New Adaptive Routing Based on the Dijkstra Algorithm in Optical Networks-on-Chip

Micromachines ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 54
Author(s):  
Yan-Li Zheng ◽  
Ting-Ting Song ◽  
Jun-Xiong Chai ◽  
Xiao-Ping Yang ◽  
Meng-Meng Yu ◽  
...  
Keyword(s):  
Power Consumption ◽  
Power Control ◽  
Optical Networks ◽  
Output Power ◽  
Network Performance ◽  
Transmission Loss ◽  
Adaptive Routing ◽  
Dijkstra Algorithm ◽  
Networks On Chip ◽  
On Chip

The photoelectric hybrid network has been proposed to achieve the ultrahigh bandwidth, lower delay, and less power consumption for chip multiprocessor (CMP) systems. However, a large number of optical elements used in optical networks-on-chip (ONoCs) generate high transmission loss which will influence network performance severely and increase power consumption. In this paper, the Dijkstra algorithm is adopted to realize adaptive routing with minimum transmission loss of link and reduce the output power of the link transmitter in mesh-based ONoCs. The numerical simulation results demonstrate that the transmission loss of a link in optimized power control based on the Dijkstra algorithm could be maximally reduced compared with traditional power control based on the dimensional routing algorithm. Additionally, it has a greater advantage in saving the average output power of optical transmitter compared to the adaptive power control in previous studies, while the network size expands. With the aid of simulation software OPNET, the network performance simulations in an optimized network revealed that the end-to-end (ETE) latency and throughput are not vastly reduced in regard to a traditional network. Hence, the optimized power control proposed in this paper can greatly reduce the power consumption of s network without having a big impact on network performance.

A Map-Reduce Approach for the Dijkstra Algorithm in SDN Over Osmotic Computing Systems

2021 ◽  
Author(s):  
Maria Fazio ◽  
Alina Buzachis ◽  
Antonino Galletta ◽  
Antonio Celesti ◽  
Jiafu Wan ◽  
...  
Keyword(s):  
Map Reduce ◽  
Dijkstra Algorithm ◽  
Computing Systems

Research on pull-type multi-AGV system dynamic path optimization based on time window

2021 ◽  
pp. 095440702098271
Author(s):  
Hongying Shan ◽  
Chuang Wang ◽  
Cungang Zou ◽  
Mengyao Qin
Keyword(s):  
Path Planning ◽  
Time Window ◽  
Planning Problem ◽  
Dijkstra Algorithm ◽  
Before And After ◽  
Common Planning ◽  
Planning Algorithm ◽  
Dynamic Path ◽  
Set Up ◽  
Path Planning Algorithm

This paper is a study of the dynamic path planning problem of the pull-type multiple Automated Guided Vehicle (multi-AGV) complex system. First, based on research status at home and abroad, the conflict types, common planning algorithms, and task scheduling methods of different AGV complex systems are compared and analyzed. After comparing the different algorithms, the Dijkstra algorithm was selected as the path planning algorithm. Secondly, a mathematical model is set up for the shortest path of the total driving path, and a general algorithm for multi-AGV collision-free path planning based on a time window is proposed. After a thorough study of the shortcomings of traditional single-car planning and conflict resolution algorithms, a time window improvement algorithm for the planning path and the solution of the path conflict covariance is established. Experiments on VC++ software showed that the improved algorithm reduces the time of path planning and improves the punctual delivery rate of tasks. Finally, the algorithm is applied to material distribution in the OSIS workshop of a C enterprise company. It can be determined that the method is feasible in the actual production and has a certain application value by the improvement of the data before and after the comparison.

Sign in / Sign up

Export Citation Format

Share Document