MapReduce Algorithm for Single Source Shortest Path Problem

Kumar, Praveen; Csed, Mnnit Allahabad; Singh, Anil Kumar

doi:10.5815/ijcnis.2020.03.02

Cited by 4 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…OSPF protocol employs the link-state algorithm known as the Dijkstra algorithm or the Shortest Path First (SPF) algorithm. However, given the current increasingly large and dynamic network conditions, the Dijkstra algorithm itself is no longer efficient [5]. Hence, optimization of the algorithm in determining the best path or route is necessary.…”

Section: Introductionmentioning

confidence: 99%

Network Routing Optimization Using Tabu Search Algorithm in Dynamic Routing

Iskandar (Scopus ID: 55316114000)

2023

CoreIT

View full text Add to dashboard Cite

Internet penetration is increasing along with the need for data packages for communication such as social media, chatting, video conferencing and others. On large-scale networks such as the Internet, dynamic routing is used to build routing protocol information in the routing table automatically. Currently, Djikstra's algorithm is used to solve the shortest path problem in dynamic routing. In this research, the optimization of the algorithm is carried out in determining the best path or trajectory. One of the optimization algorithms is the Tabu Search Algorithm which can guide heuristic local search procedures to explore the solution area outside the local optimum point. This optimization is assessed from the test parameters measured from the smallest cost. The data analyzed is in the form of bandwidth and topological flow. From the results of tracing the path of data packets sent through 9 routers using the Tabu Search algorithm with the parameters namely number of Neighbor Solutions = 50, Length of tabu list = 10, Maximum Number of Iterations = 100, the result of the path matrix value is 180.9676. The path taken is router 0-2-4-8-9

show abstract

Section: Introductionmentioning

confidence: 99%

Network Routing Optimization Using Tabu Search Algorithm in Dynamic Routing

Iskandar (Scopus ID: 55316114000)

2023

CoreIT

View full text Add to dashboard Cite

show abstract

“…Several MapReduce programming platforms have been so far developed [13,14,15,18,19,20] that provide APIs for graph operations and show how to implement some basic algorithms, such as page ranking, SPP, and MST, by using those APIs. There are also MapReduce algorithms for the maximum clique problem [21], the maximum cover problem [22], the maximum flow problem [23], and the shortest-path problem [24].…”

Section: Introductionmentioning

confidence: 99%

A MapReduce Algorithm for Minimum Vertex Cover Problems and Its Randomization

Nakamura

Kinjo

Yoshida

2020

cai

View full text Add to dashboard Cite

MapReduce is a programming paradigm for large-scale distributed information processing. This paper proposes a MapReduce algorithm for the minimum vertex cover problem, which is known to be NP-hard. The MapReduce algorithm can efficiently obtain a minimal vertex cover in a small number of rounds. We show the effectiveness of the algorithm through experimental evaluation and comparison with exact and approximate algorithms which demonstrates a high quality in a small number of MapReduce rounds. We also confirm from experimentation that the algorithm has good scalability allowing high-quality solutions under restricted computation times due to increased graph size. Moreover, we extend our algorithm to randomized one to obtain a good expected approximate ratio.

show abstract

“…Meta-heuristics possess the ability to handle supplementary constraints and produce near-optimal path solutions within acceptable computational timeframe, applicable to networks of varying scales, from small to large [46]. Metaheuristic approaches like Genetic Algorithms (GAs), Particle Swarm Optimization (PSO) algorithms, and Ant Colony Optimization (ACO) algorithms have found extensive application in addressing shortest path problems across various research domains; for example, Kumar and Kumar [47] utilized genetic algorithms (GA) to identify the shortest path in data networks. Rares tackled the shortest path routing issue in rapidly evolving networks with heavy traffic loads, employing an enhanced GA incorporating an adaptive mutation operator [48].…”

mentioning

confidence: 99%

Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW)

Maroof,

Ayvaz,

Naeem

2024

IEEE Access

View full text Add to dashboard Cite

The Vehicle Routing Problem with Time Windows (VRPTW) is paramount in elevating operational efficiency, driving cost reductions, and enhancing customer satisfaction. It is a renowned challenge with diverse real-world applications, where the core objective is determining the most efficient routes for a fleet of vehicles. This research introduces a cutting-edge Hybrid Genetic Algorithm-Solomon Insertion Heuristic (HGA-SIH) solution, reinforced by the powerful Solomon Insertion constructive heuristic to solve the VRPTW as an NP-hard problem. The performance of the proposed HGA-SIH is validated against Solomon's VRPTW benchmark instances. The results showcase the outstanding performance of HGA, achieving Best-Known Solutions (BKS) for 11 instances and enhancing BKS solutions in one instance. Experimental findings validate that HGA-SIH consistently delivers results on par with or surpasses those obtained by several cutting-edge algorithms when evaluated based on various solution quality metrics. HGA-SIH consistently excels in efficiently managing the number of vehicles while minimizing travel distances, resulting in slight deviations from BKS that remain within practical limits. The research highlights the adaptability and efficacy of HGA-SIH in addressing a wide range of VRPTW scenarios, thereby making substantial contributions to logistics and supply chain optimization.

show abstract

MapReduce Algorithm for Single Source Shortest Path Problem

Cited by 4 publications

References 19 publications

Network Routing Optimization Using Tabu Search Algorithm in Dynamic Routing

Network Routing Optimization Using Tabu Search Algorithm in Dynamic Routing

A MapReduce Algorithm for Minimum Vertex Cover Problems and Its Randomization

Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW)

Contact Info

Product

Resources

About