Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Abstract --Today, most routing problems are solved using Dijk-stra's shortest path algorithm. Many efficient implementations of
 

Summary: Abstract -- Today, most routing problems are solved using Dijk-
stra's shortest path algorithm. Many efficient implementations of
Dijkstra's algorithm exist and can handle large networks in short
runtimes. Despite these advances, it is difficult to incorporate user-
specific conditions on the solution when using Dijkstra's algorithm.
Such conditions can include forcing the path to go through a specif-
ic node, forcing the path to avoid a specific node, using any combi-
nation of inclusion/exclusion of nodes in the path, etc. In this paper,
we propose a new approach to solving the shortest path problem us-
ing advanced Boolean satisfiability (SAT) techniques. SAT has been
heavily researched in the last few years. Significant advances have
been proposed and has lead to the development of powerful SAT
solvers that can handle very large problems. SAT solvers use intel-
ligent search algorithms that can traverse the search space and ef-
ficiently prune parts that contain no solutions. These solvers have
recently been used to solve many problems in Engineering and
Computer Science. In this paper, we show how to formulate the
shortest path problem as a SAT problem. Our approach is verified
on various network topologies. The results are promising and indi-
cate that using the proposed approach can improve on previous

  

Source: Aboelaze, Mokhtar - Department of Computer Science, York University (Toronto)
Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Computer Technologies and Information Sciences; Engineering