https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Glielmo_et_al_2015aGlielmo et al 2015a - Revision history2026-04-17T04:04:53ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Glielmo_et_al_2015a&diff=191172&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 175816890 to Glielmo et al 2015a2021-01-28T16:06:35Z<p>Scipediacontent moved page <a href="/public/Draft_Content_175816890" class="mw-redirect" title="Draft Content 175816890">Draft Content 175816890</a> to <a href="/public/Glielmo_et_al_2015a" title="Glielmo et al 2015a">Glielmo et al 2015a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 16:06, 28 January 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Glielmo_et_al_2015a&diff=191171&oldid=prevScipediacontent: Created page with " == Abstract == This paper presents an algorithm for managing the demand and supply in a shared transportation system. In particular we present a method, independent from the..."2021-01-28T16:06:30Z<p>Created page with " == Abstract == This paper presents an algorithm for managing the demand and supply in a shared transportation system. In particular we present a method, independent from the..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
This paper presents an algorithm for managing the demand and supply in a shared transportation system. In particular we present a method, independent from the Geographic Information System (GIS), which processes drivers and passengers requests and ranks them in order to encourage matching and to propose the solution profitable for all. The basic idea is to give priority to the requests of passengers with more common route and avoid those with greater excess path. In the end, we propose a solution for the distribution of costs among the participants of shared travel based on the application of the Shapley value.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://dx.doi.org/10.5220/0005459501520158 http://dx.doi.org/10.5220/0005459501520158]<br />
<br />
* [http://pdfs.semanticscholar.org/6382/5eba3c253b9a68edf3dc1d1226f4763c1340.pdf http://pdfs.semanticscholar.org/6382/5eba3c253b9a68edf3dc1d1226f4763c1340.pdf]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/vehits/vehits2015.html#SianoGG15 https://dblp.uni-trier.de/db/conf/vehits/vehits2015.html#SianoGG15],<br />
: [https://academic.microsoft.com/#/detail/2331981624 https://academic.microsoft.com/#/detail/2331981624]</div>Scipediacontent