scholarly journals About one route problem with interior works

2012 ◽  
pp. 96-119 ◽  
Author(s):  
I.B. Cheblokov ◽  
◽  
A.G. Chentsov ◽  
Keyword(s):  
Route Problem

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

Solutions of the Shortest-Route Problem—A Review

1960 ◽  
Vol 8 (2) ◽  
pp. 224-230 ◽  
Author(s):  
Maurice Pollack ◽  
Walter Wiebenson
Keyword(s):  
Route Problem ◽  
Shortest Route

scholarly journals One task of routing jobs in high radiation conditions

2021 ◽  
Vol 58 ◽  
pp. 94-126
Author(s):  
A.G. Chentsov ◽  
A.A. Chentsov ◽  
A.N. Sesekin
Keyword(s):  
Dynamic Programming ◽  
Numerical Solution ◽  
Model Problem ◽  
Optimal Solution ◽  
High Radiation ◽  
Dose Load ◽  
Route Problem ◽  
Precedence Conditions ◽  
Sequential Bypass ◽  
Radiation Conditions

The problem of sequential bypass of megalopolises is investigated, focused on the problem of dismantling a system of radiation hazardous objects under constraints in the form of precedence conditions. The radiation impact on the performers is assessed by the doses received during movements and during the performance of dismantling works. The route problem of minimizing the dose load of workers carrying out dismantling in one or another sequence of operations is considered. The procedure for constructing an optimal solution using a variant of dynamic programming is investigated. On this basis, an algorithm is built, implemented on a PC. Examples of the numerical solution of a model problem for the minimum dose load are given.

How Ants Can Efficiently Solve Generalized Watchman Route Problem

2011 ◽  
Vol 2 (3) ◽  
pp. 1-15 ◽  
Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha
Keyword(s):  
Mobile Robot ◽  
Ant Algorithm ◽  
Route Problem ◽  
Shortest Route

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.

scholarly journals Optimization of Earthwork Allocation Path as Vehicle Route Problem Based on Genetic Algorithm

2020 ◽  
Vol 165 ◽  
pp. 04057
Author(s):  
Naifu Deng ◽  
Xuyang Li ◽  
Yanmin Su
Keyword(s):  
Genetic Algorithm ◽  
Optimization Model ◽  
Construction Projects ◽  
Vehicle Route Problem ◽  
Vehicle Route ◽  
Route Problem ◽  
Modified Genetic Algorithm ◽  
Global Optimal ◽  
The Cost ◽  
Engineering Projects

In civil engineering, earthwork, prior to the construction of most engineering projects, is a lengthy and time-consuming work involving iterative processes. The cost of many AEC (Architecture, Engineering and Construction) projects is highly dependent on the efficiency of earthworks (e.g. road, embankment, railway and slope engineering). Therefore, designing proper earthwork planning is of importance. This paper simplifies the earthwork allocation problem to Vehicle Route Problem (VRP) which is commonly discussed in the field of transportation and logistics. An optimization model for the earthwork allocation path based on the modified Genetic Algorithm with a self-adaptive mechanism is developed to work out the global optimal hauling path for earthwork. The research results also instruct the initial topographic shaping of the Winter Olympic Skiing Courses Project. Furthermore, this optimization model is highly compatible with other evolutionary algorithms due to its flexibility, therefore, further improvement in this model is feasible and practical.

Sign in / Sign up

Export Citation Format

Share Document