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

39 results for “shortest path algorithm”
Set a search alert
Research ArticleOpen accessIn the abstractOPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITYRanjana Ponraj, George AmalanathanThe Multiple Travelling Salesman Problems (MTSP) can be used in a wide range of discrete optimization problems. As the solution to this problem has wide applicability in many practical fields, this NP Hard problem highly raises the need for an efficient solution. The problem is determining a set of routes for the salesmen that jointly visit a set of given … …Journal of Computer Science, Vol. 10, Issue 4 · 23 Dec 2013 · 6,795 accessesView PDFCite
Research ArticleOpen accessIn the abstractA 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 accessIn the abstractAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,049 accessesView PDFCite
Research ArticleOpen accessIn the abstractSECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREMSrinath Doss, Janet JeyarajRecent days, research in wireless network becomes major area for the past few decades. In wireless routing many routing methods such as table driven, source driven; many characteristics such as reactive routing, proactive routing; many routing algorithms such as dijikstra’s shortest path, distributed bell-man ford algorithm are proposed in the literature. For effective wireless routing, the recent ant colony optimization … …Journal of Computer Science, Vol. 9, Issue 9 · 6 Aug 2013 · 6,560 accessesView PDFCite
Research ArticleOpen accessIn the abstractReal Time Multigraphs for Communication Networks: An Intuitionistic Fuzzy Mathematical ModelSiddhartha Sankar Biswas, Bashir Alam, Mohammad Najmud DojaMany problems of computer science, communication network, transportation systems, can be modeled into multigraphs (or graphs) and then can be solved. Nowadays, the networks are expanding very fast in huge volumes in terms of their nodes and the connecting links. For a given alive network, in many situations, its complete topology may not be always available to the communication systems … …Journal of Computer Science, Vol. 9, Issue 7 · 17 Jun 2013 · 7,068 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeneralization 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 accessIn the abstractTraversal Algorithm for Complete CoverageKavitha Thiayagarajan, Coimbatore Ganeshsankar BalajiThere are many applications which require complete coverage and obstacle avoidance. The classical A* algorithm provides the user a shortest path by avoiding the obstacle. As well, the Dijkstra’s algorithm finds the shortest path between the source and destination. But in many applications we require complete coverage of the proposed area with obstacle avoidance. There are LSP, LSSP, BSA, spiral-STC … …Journal of Computer Science, Vol. 8, Issue 12 · 15 Dec 2012 · 7,120 accessesView PDFCite
Research ArticleOpen accessIn the abstractFlow Based AlgorithmT. Karpagam, V. J. Sudhakar, N. Arunsankar, M. DhanasekaranProblem statement: Network topology design problems find application in several real life scenario. Approach: Most designs in the past either optimize for a single criterion like shortest or cost minimization or maximum flow. Results: This study discussed about solving a multi objective network topology design problem for a realistic traffic model specifically in the pipeline transportation. Here flow based algorithm … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 22 Dec 2011 · 8,482 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Optimal Path Management Strategy in Mobile Ad Hoc Network Using Fuzzy and Rough Set TheoryP. Seethalakshmi, M. Joseph Auxilius Jude, G. RajendranProblem statement: Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes that dynamically forms a network. Most of the existing ad-hoc routing algorithms select the shortest path using various resources. However the selected path may not consider all the network parameters and this would result in link instability in the network. The problems with existing methods are … …American Journal of Applied Sciences, Vol. 8, Issue 12 · 15 Oct 2011 · 7,667 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,813 accessesView PDFCite