<html dir="ltr">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<style type="text/css" id="owaParaStyle"></style>
</head>
<body fpstyle="1" ocsi="0">
<div style="direction: ltr;font-family: Tahoma;color: #000000;font-size: 10pt;">
<div style="font-family: Times New Roman; color: #000000; font-size: 16px">
<div id="divRpF546076" style="direction: ltr;"><span style="color: rgb(34, 34, 34); font-family: arial, sans-serif; font-size: small;">Hello,</span></div>
<div>
<div style="direction:ltr; font-family:Tahoma; color:#000000; font-size:10pt">
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
<br>
</div>
<div style="line-height:normal"><font color="#222222" face="arial, sans-serif" size="2">for a project in the course of my master thesis, I use pgRouting to find the route with least energy consumption for e-bikes. Accordingly, my model calculates the energy
consumption (Wh) which is implemented as cost factor. Due to recuperation, I have several negative edge costs. </font><span style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; background-color:rgb(255,255,255)">Therefore, I need an algorithm
which takes this circumstance into concideration. Unfortunetly, the appropriate single source shortest path (SSSP) algorithm (Bellman-Ford) is not yet part of pgRouting ( </span><a href="http://www.boost.org/doc/libs/master/libs/graph/doc/bellman_ford_shortest.html" style="font-size:10pt" target="_blank">http://www.boost.org/doc/libs/master/libs/graph/doc/bellman_ford_shortest.html</a> ).<span style="font-size:10pt"> Previous
enquiries ( </span><a href="http://lists.osgeo.org/pipermail/pgrouting-users/2013-July/001589.html" style="font-size:10pt" target="_blank">http://lists.osgeo.org/pipermail/pgrouting-users/2013-July/001589.html</a><span style="font-size:10pt"> ) did not solve
that problem.</span></div>
<div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
<br>
</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
<span style="background-color:rgb(255,255,255)">Do you have any recommendation how to deal with this kind of matter?</span></div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
<br>
</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
Possible approaches:</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
<br>
</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
- Anyone who created a beta version / pgRouting-command of the above mentioned Bellman-Ford?</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
- altering existing all pairs algorithms (johnson's, floyd warshall) which theoretically allow scattered negative edge costs (in pgRouting too?) to SSSP like dijkstra</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
- idea for a workaround (e.g. adapting the cost calculating model so there are no negative edges no more)</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
- another develompment tool / framework that runs Belman Ford?</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
<br>
</div>
<div style="color:rgb(34,34,34); font-family:arial,sans-serif; font-size:small; line-height:normal">
Thanks for your help!</div>
</div>
</div>
</div>
</div>
</div>
</body>
</html>