• Home
  • Search
  • New Polynomial Shortest Path Algorithms and Their Computational Attributes
  • Cite Icon45
  • https://doi.org/10.1287/mnsc.31.9.1106Copy DOI Icon

New Polynomial Shortest Path Algorithms and Their Computational Attributes

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents six new variants of the polynomially bounded Partitioning Shortest Path (PSP) algorithm for finding the shortest path from one node to all other nodes in a network. Three of these variants, one for negative arc lengths, but without negative cycles, and two for nonnegative arc lengths, augment the PSP algorithm to maintain a property called sharp by Shier and Witzgall. The other three variants augment the PSP algorithm to maintain a property called near-sharp for nonnegative arc lengths. Extensive computational testing is presented on one of the sharp variants for nonnegative arc lengths and two of the near-sharp variants. The empirical results based on 4500 test problems with 90 different configurations and three different network topologies indicate that these new algorithms have excellent computational performance characteristics. Based on total solution times for the 4500 test problems, these new algorithms out-perform all other algorithms tested. In addition, one of the near-sharp algorithms strictly dominates all others on all problem topologies tested.

Similar Papers
  • Research Article
  • Citations22

A Multiple Pairs Shortest Path Algorithm

  • Nov 01, 2005
  • Transportation Science
  • I-Lin Wang +2
  • Research Article
  • Citations25

An effective heuristic for computing many shortest path alternatives in road networks

  • Jun 01, 2012
  • International Journal of Geographical Information Science
  • Stéphanie Vanhove +1
  • Conference Article
  • Citations8

Autonomous routing algorithms for networks with wide-spread failures

  • Oct 01, 2009
  • Wajahat Khan +2
  • Conference Article
  • Citations1

A linear time pre-processing for optimization of shortest path and distance algorithms

  • Aug 01, 2017
  • Neeta A Eapen +1
  • Conference Article
  • Citations3

Improved Route Selection Strategy Based on K Shortest Path

  • Jun 01, 2019
  • Guanghao Huang +3
  • Conference Article
  • Citations5

Shortest Path Algorithm for Pore-scale Simulation of Water-alternating-gas Injection

  • Sep 08, 2008
  • Proceedings
  • M.I.J Van Dijke +2
  • Research Article
  • Citations169

Negative-cycle detection algorithms

  • Jun 01, 1999
  • Mathematical Programming
  • Boris V Cherkassky +1
  • Book Chapter
  • Citations8

Encoding Travel Traces by Using Road Networks and Routing Algorithms

  • Jan 01, 2012
  • Pablo Martinez Lerin +2
  • Research Article
  • Citations30

The time-dependent shortest path and vehicle routing problem

  • Aug 28, 2021
  • INFOR: Information Systems and Operational Research
  • Rabie Jaballah +3
  • Research Article
  • Citations19

A comparison of algorithms for origin–destination matrix generation on real road networks and an approximation approach

  • Apr 06, 2008
  • Computers & Industrial Engineering
  • Byung-In Kim +1
  • Research Article
  • Citations23

Improved Algorithms for Dynamic Shortest Paths

  • Jan 01, 2000
  • Algorithmica
  • H N Djidjev +2
  • Conference Article
  • Citations29

Optimal-Capacity, Shortest Path Routing in Self-Organizing 5G Networks using Machine Learning

  • Apr 01, 2019
  • Chetana V Murudkar +1
  • Research Article
  • Citations69

A new algorithm for shortest paths among obstacles in the plane

  • Mar 01, 1991
  • Annals of Mathematics and Artificial Intelligence
  • Joseph S B Mitchell
  • Conference Article
  • Citations10

New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2

  • Jun 01, 2007
  • H Ishikawa +4
  • Conference Article
  • Citations79

Improved distributed algorithms for exact shortest paths

  • Jun 20, 2018
  • Mohsen Ghaffari +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.