Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

48 articles for “Shortest Path”
Set a search alert
Research ArticleOpen accessPhrase in the titleTransTrip: A Shortest Path Finding Application for Jakarta Public Transportation using Dijkstra AlgorithmRini Wongso, Cin Cin, Suhartono, JosephGovernment of Jakarta, the capital of Indonesia, highlighted congestion as one of the issues that must be addressed immediately. The high population of Jakarta increases the number of vehicles operating on the streets and causes congestion that leads to a loss of 67.5 trillion rupiah. The development of adequate public transport facilities is expected to be one of the solution, … …Journal of Computer Science, Vol. 14, Issue 7 · 29 Jun 2018 · 9,328 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA REFINEMENT OF DIJKSTRA'S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHSSiddhartha Sankar Biswas, Bashir Alam, M. N. DojaThe networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from internal or external agents, sudden failure of one or … …Journal of Computer Science, Vol. 10, Issue 4 · 14 Dec 2013 · 7,260 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleGeneralization of Dijkstra’s Algorithm for Extraction of Shortest Paths in Directed MultigraphsBashir Alam, Siddhartha Sankar Biswas, M. N. DojaThe classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short). The GDA outputs the shortest paths and the corresponding min cost. It … …Journal of Computer Science, Vol. 9, Issue 3 · 29 Apr 2013 · 7,466 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,617 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleStrength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer NetworksSubbaraj Potti, Chitra ChinnasamyProblem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA), is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing … …Journal of Computer Science, Vol. 7, Issue 1 · 16 Dec 2010 · 8,216 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleCargo Route Optimization Using Shortest Path Algorithms: Runtime and Validity ComparisonDedy Rahman Wijaya, Aqil Athallah, Tiara Nuha Noor’afina et al.The Indonesian logistics industry is facing significant challenges related to inefficiency and irregularity, particularly in the commodity cargo route system. This issue is further exacerbated by the high logistics costs in the country, which currently stands at 23%, higher than that of other countries. To address this issue, this study proposes an implementation and examination of several algorithms Greedy, Best … …Journal of Computer Science, Vol. 19, Issue 11 · 19 Oct 2023 · 6,351 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleBased Approach to Improve the All-Pair Shortest Path ComputationLau Nguyen Dinh, Le Thanh TuanThis paper presents the development of a centralized algorithm for finding the shortest path between all pairs of vertices on a graph, utilizing the basic structure of the Floyd-Warshall sequential algorithm. The proposed algorithm leverages multiple processors to compute the shortest path between all vertex pairs, with one processor taking the central role in data management. This central processor divides … …Journal of Computer Science, Vol. 21, Issue 7 · 30 Jun 2025 · 2,903 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleGeneralized Shortest Path Problem in Uncertain Environment Based on PSOHayder A. Mukhef, Ekhlas M. Farhan, Mohammed R. JassimGeneralized network problems describe situations in which flow can be generated or consumed through arcs. This research considers generalized shortest path problem in stochastic environment in which the changing rate of flow is random. To satisfy the demands of decision makers, three types of models have been formulated to solve the generalized shortest path problem under different decision criteria. The … …Journal of Computer Science, Vol. 4, Issue 4 · 30 Apr 2008 · 6,749 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleThe Shortest Path with Intelligent AlgorithmSurachai PanichProblem statement: Path planning algorithms need to be developed and implemented in a suitable manner to give better understanding about the intelligent system and also stimulates technological supply to enormous demands in an intelligent vehicle industry. Approach: This study concerned with intelligent path planning using A* search algorithm. Results: This study introduced intelligent path planning with A* search algorithm, which … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 7,194 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleShape Retrieval through Angular Distance with Shortest Augmenting Path AlgorithmD. Chitra, N. Devarajan, T. ManigandanProblem statement: The shape of an object is very important in object recognition. Shape matching is a challenging problem, especially when articulation and deformation of a part occurs. These variations may be insignificant for human recognition but often cause a matching algorithm to give results that are inconsistent with our perception. Approach: We proposed a customized approach to measure similarity … …Journal of Computer Science, Vol. 7, Issue 12 · 21 Oct 2011 · 6,817 accessesView PDFCite