scholarly journals An efficient approach for solving Travelling Sales Man Problem

2021 ◽  
Vol 9 (8) ◽  
pp. 2793--2798
Author(s):  
Tirumalasetti Guna Sekhar
Keyword(s):  
Urban Communities ◽  
Shortest Path ◽  
Urban Areas ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Dijkstra Algorithm ◽  
A Algorithm ◽  
Fundamental Goal ◽  
Time And Space Complexity ◽  
The City

Abstract: Global Position System (GPS) application is quite possibly the most valuable instrument in transportation the executives nowadays. The Roadway transportation is an significant function of GPS. To track down the briefest courses to a spot is the key issue of organization investigation. To address this issue, we have numerous calculations and procedures like Dijkstra algorithm, Ant Colony Optimization, Bellman Portage Algorithm, Floyd-Warshall algorithm, Genetic Algorithm, A* Algorithm furthermore, numerous others. In this paper our fundamental goal is to assess the brute force algorithm and the dynamic programming algorithm in settling the Shortest path issue (The travelling salesman issue). The paper will be finished up by giving the results of time and space complexity of these algorithms. To help a salesman visit every one of the urban communities in the rundown (giving the area of urban areas as the information) and he knows the area of the multitude of urban communities and track down the shortest path with the end goal that he visits every one of the urban areas just a single time and gets back to the city where he begun. The distance (cost) and the relating way ought to be shown as yield.

scholarly journals SUSTAINABILITY LEVEL OF DENSELY POPULATED AREA: JATIMULYO URBAN COMMUNITIES, LOWOKWARU DISTRICT, MALANG CITY

2019 ◽  
Vol 21 (4) ◽  
pp. 718
Author(s):  
S Haryani
Keyword(s):  
Urban Communities ◽  
Urban Areas ◽  
Urban Spatial Structure ◽  
City Development ◽  
Large Cities ◽  
Mixed Use ◽  
Big City ◽  
Calculation Results ◽  
Population Urbanization ◽  
The City

Large cities still peak the interests of some Indonesian society. Big city development as the center of economic activity is a powerful pull for society, influencing high workforce from both inside and outside of the city, causing a strong current of urbanization. One main problem that always accompanies urban areas development is density population. Urbanization has caused a very rapid explosion in the city population; one implication is the clumping workforce in large Indonesian cities. The high number of people who choose to settle in the city increase the number of both legal and illegal settlements. In the high-density settlement, many houses are not liveable and irregular. The densely populated settlements find many houses unfit for habitation and irregular. The research aims to formulate the sustainability level of Urban communities, Lowokwaru District, Malang City using quantitative method through sustainability level calculation. Jatimulyo Urban Communities is measured by the sustainability criteria of density, diversity, mixed-use, and compactness to formulate the related sustainable urban spatial structure. Interpretation of the calculation results references similar research. The calculation result shows that Jatimulyo Urban Communities is included in the moderate sustainability level, where density is moderate (101.1-200 people/ha), has a moderate building density (20-40 buildings/ha), has a random diversity level (1.0) and an entropy index (0.51), and compactness is near perfect inequality (Gini Coefficient 0.99).

scholarly journals Spatial inequality hides the burden of dog bites and the risk of dog-mediated human rabies

2020 ◽  
Author(s):  
Micaela De la Puente-León ◽  
Michael Z. Levy ◽  
Amparo M. Toledo ◽  
Sergio Recuenco ◽  
Julianna Shinnick ◽  
...  
Keyword(s):  
Urban Communities ◽  
Urban Areas ◽  
Spatial Inequality ◽  
Human Rabies ◽  
Medical Facility ◽  
Factors Associated ◽  
Dog Bites ◽  
The People ◽  
The City

ABSTRACTCurrently, there is an active rabies outbreak in the dog population of Arequipa, Peru. Inhabitants of the city are bitten by both pets and free-roaming dogs; therefore, the risk of human rabies transmission is concerning. Our objective was to estimate the rate of dog bites in the city and to identify factors associated with going or not going to a medical facility for rabies follow-up. To this end, we conducted a door-to-door survey of 4,000 houses in 21 urban and 21 peri-urban communities. We then analyzed associations between attaining follow-up rabies care and various socioeconomic factors, stratifying by urban and peri-urban localities. We found that the rate of dog bites in peri-urban communities (12.4%) was approximately three times higher than urban areas (4.0%). Among the people who were bitten, a significantly greater number of people in urban areas got follow-up rabies care than those in peri-urban areas.

scholarly journals Shortest Path Search Futsal Field Location With Dijkstra Algorithm

2018 ◽  
Vol 12 (2) ◽  
pp. 161 ◽  
Author(s):  
Delpiah Wahyuningsih ◽  
Erzal Syahreza
Keyword(s):  
Shortest Path ◽  
Destination Node ◽  
Dijkstra Algorithm ◽  
Initial Node ◽  
Shortest Route ◽  
Path Search ◽  
Surrounding Areas ◽  
The City ◽  
Shortest Path Search

Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.

scholarly journals Algoritma Dijkstra untuk Penentuan Jarak Tempuh Terpendek Pengantaran Katering Pabrik

MIND Journal ◽  
2021 ◽  
Vol 5 (2) ◽  
pp. 108-120
Author(s):  
THETA DINNARWATY PUTRI ◽  
WINARNO SUGENG ◽  
EKA SAFITRI
Keyword(s):  
Artificial Intelligence ◽  
Travel Time ◽  
Shortest Path ◽  
Dijkstra Algorithm ◽  
Initial Location ◽  
The City

AbstrakAlgoritma Dijkstra digunakan untuk menemukan jalur terpendek antara titik pada graf dan persamaan Haversine digunakan untuk mengukur jarak dari lokasi awal menuju lima lokasi tujuan yang mana lokasi tersebut merupakan pabrik yang berada di kota Cikarang dan lokasinya ada di sekitaran penyedia rumah catering. Perhitungan dilakukan setelah sistem mendapatkan koordinat latitude dan longitude pengguna dan lokasi pabrik yang dituju. Pada penelitian ini, lokasi pengguna dan lokasi pabrik dilakukan di kota Cikarang. Sistem mampu menampilkan prediksi jarak dan waktu tempuh untuk  rekomendasi dari urutan lima pengantaran dengan penerapan metode algoritma Dijkstra dimana proses yang dilakukan sistem adalah memperhitungkan jarak menggunakan Haversine Formula, sehingga didapatkan waktu tempuh berdasarkan parameter kemacetan. selain itu API mampu memvisualisasikan rute setiap tujuan dari titik lokasi katering.Kata kunci: Dijkstra, Formula Haversine, PHP, Jarak terpendek, Kecerdasan Buatan.AbstractThe algorithm is used to find the shortest path between points on a graph. The Haversine formula is used to measure the distance from the initial location to the five destination locations where the factory is located in Cikarang and the location is around the location catering house. Calculations are carried out after the system gets the user’s latitude and longitude coordinates and the intended factory. In this study, the location of the user and the location of the factory were carried out in the city of Cikarang. The system is suitable to display distance and travel time predictions for recommendations from the order of five deliveries by applying the Dijkstra algorithm method. The process that is carried out by the system, calculates the distance using Haversine formula. Thus, the travel time is obtained bases on congestion parameters. In Addition, besides the API is able to visualize the route of each destination from the catering location point.Keywords: Dijkstra, Haversine Formula, PHP, Shortest Path, Artificial Intelligence.

Target Searching of Mobile Robots Using Improved A* Searching Algorithm

2013 ◽  
Vol 300-301 ◽  
pp. 519-522 ◽  
Author(s):  
Chih Hung Chang ◽  
Jie Tong Zou ◽  
Kuo Lan Su
Keyword(s):  
Shortest Path ◽  
Dynamic Environment ◽  
Motion Path ◽  
Planning Problem ◽  
Dijkstra Algorithm ◽  
A Algorithm ◽  
Intelligent Node ◽  
Multiple Strategies ◽  
Time Motion ◽  
Target Searching

The paper studies motion path planning problem using improved A* searching algorithm, and implements the movement scenario using mobile robot system. Solving the shortest path problem, Dijkstra algorithm can finds the shortest path to solve the path searching problem. The searching depth is not applicable in certain circumstances to be a disadvantage. The paper proposed improved A* searching algorithm using the intelligent node judgment method, it not only be able to retain the advantages of the traditional A* algorithm but also improve the shortcomings. It programs the on-time motion path in dynamic environment; it also programs the motion path more closed to the best path. Finally, the paper uses multiple strategies to improve the searching motion path to be the best motion path, and compares with the traditional A* algorithm to reduce the searching time.

scholarly journals Smart city ambulance for tracking shortest path using global position system

2017 ◽  
Vol 7 (1.3) ◽  
pp. 187
Author(s):  
Dr M.Prakash ◽  
S. Nithyanantham ◽  
V Nishanth ◽  
A Prakash ◽  
D Kaviyarrasu
Keyword(s):  
Shortest Path ◽  
Smart City ◽  
Urban Areas ◽  
Tidal Flow ◽  
Main Theme ◽  
Dijkstra Algorithm ◽  
Control Room ◽  
Traffic Light ◽  
Traffic Lights ◽  
Alert Message

Traffic overcrowding and tidal flow management were identified as major problems in modern urban areas, which have caused much uncomfortable for the ambulance. Moreover, road accidents in the city have been nonstop and to bar the loss of life due to the accidents is even more crucial. To implement this, we introduce a scheme called Smart city ambulance system using shortest path finding algorithm and traffic signals. The main theme behind this scheme is to provide a smooth flow for the ambulance to reach the hospitals in time and thus minifying the expiration. The ambulance driver will send the request to control room. After receiving the request from control room then the ambulance is controlled by the control room which furnishes the most scant route to the ambulance and also controls the traffic light according to the ambulance location and thus reaching the hospital safely. The control room will send the alert message to the hospital. This scheme is fully controlled by control room, thus it controls the traffic lights, helping to reach the hospital in time using the shortest path Dijkstra algorithm

scholarly journals The contribution of ineffective urban planning practices to disaster and disaster risks accumulation in urban areas: the case of former Kunduchi quarry site in Dar es Salaam, Tanzania

2009 ◽  
Vol 2 (1) ◽  
Author(s):  
Benedict F. Malele
Keyword(s):  
Urban Planning ◽  
Urban Communities ◽  
Urban Areas ◽  
Disaster Risk Reduction ◽  
Local Community ◽  
Disaster Risk ◽  
Dar Es Salaam ◽  
Coping Responses ◽  
Sustainable Solutions ◽  
The City

This study examined the link between urban planning practices and disaster risks. The study used the former Kunduchi Quarry Site within the City of Dar es Salaam to demonstrate how laxity in enforcing the laid down planning rules, regulations and procedures facilitates the accumulation and occurrence of disaster risks and disasters in urban areas. This undermines one of the central roles of urban planning, which is to protect the lives of people from disaster risks and disasters. In exploring this, the study specifically focused on understanding the rules, regulations and procedures of planning in Tanzania; the extent to which they are followed and, where they are not followed, their implications for disaster risks and disasters; the coping initiatives adopted by local communities to reduce risks and their level of success or failure; and finally the drawing of lessons and recommendations for disaster risk reduction in urban areas. Strongly emerging from this study is the finding that although planning rules and regulations do exist, they are not enforced. As a result urban communities suffer from disaster risks and disasters caused by unregulated activities. The study analyzed the coping initiatives that urban communities apply to reduce disaster risks in their areas. It noted that, while a range of “coping” responses could be observed, these are not lasting solutions to the disaster risks being faced. Sustainable solutions seem to be known by the local community but they are not adopted for fear of compromising or undermining their existing livelihood strategies.

Analysis on Improved Dijkstra Algorithm in Intelligent Transportation System

2013 ◽  
Vol 385-386 ◽  
pp. 877-881
Author(s):  
Hao Yu Wang ◽  
Chao Jun Ji ◽  
Xiao Juan Ji
Keyword(s):  
Real Time ◽  
Shortest Path ◽  
Traffic Congestion ◽  
Intelligent Transportation System ◽  
Intelligent Transportation ◽  
Transportation System ◽  
Dijkstra Algorithm ◽  
Key Technology ◽  
The Core ◽  
The City

Intelligent transportation system (ITS) is a complicated system, and selecting the shortest path is the core of the system. In order to ease traffic congestion of the city, through solving the shortest path, the key technology in realizing the function of ITS, and based on the analysis of traditional Dijkstra algorithm, the paper puts forward the improved algorithm. The new algorithm includes two parts, that is, preprocessing and real-time pruning research, and the effect of pruning totally depends on the division of specific diagram.

scholarly journals A dynamic programming algorithm for solving the k-Color Shortest Path Problem

2020 ◽  
Author(s):  
Daniele Ferone ◽  
Paola Festa ◽  
Serena Fugaro ◽  
Tommaso Pastore
Keyword(s):  
Mathematical Model ◽  
Dynamic Programming ◽  
Branch And Bound ◽  
Shortest Path ◽  
Dynamic Programming Algorithm ◽  
Shortest Path Problem ◽  
Programming Algorithm ◽  
Colored Graph ◽  
Transmission Networks ◽  
The Mathematical Model

Abstract Several variants of the classical Constrained Shortest Path Problem have been presented in the literature so far. One of the most recent is the k-Color Shortest Path Problem ($$k$$ k -CSPP), that arises in the field of transmission networks design. The problem is formulated on a weighted edge-colored graph and the use of the colors as edge labels allows to take into account the matter of path reliability while optimizing its cost. In this work, we propose a dynamic programming algorithm and compare its performances with two solution approaches: a Branch and Bound technique proposed by the authors in their previous paper and the solution of the mathematical model obtained with CPLEX solver. The results gathered in the numerical validation evidenced how the dynamic programming algorithm vastly outperformed previous approaches.

Sign in / Sign up

Export Citation Format

Share Document