https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Chini_et_al_2014aChini et al 2014a - Revision history2026-04-23T15:20:06ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Chini_et_al_2014a&diff=209602&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 453972974 to Chini et al 2014a2021-02-08T08:49:09Z<p>Scipediacontent moved page <a href="/public/Draft_Content_453972974" class="mw-redirect" title="Draft Content 453972974">Draft Content 453972974</a> to <a href="/public/Chini_et_al_2014a" title="Chini et al 2014a">Chini et al 2014a</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 08:49, 8 February 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=Chini_et_al_2014a&diff=209601&oldid=prevScipediacontent: Created page with " == Abstract == This paper deals with dynamic Multi-Vehicle Routing Problem in both deterministic and stochastic scenarios; the objective is to find the best paths for a flee..."2021-02-08T08:49:07Z<p>Created page with " == Abstract == This paper deals with dynamic Multi-Vehicle Routing Problem in both deterministic and stochastic scenarios; the objective is to find the best paths for a flee..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
This paper deals with dynamic Multi-Vehicle Routing Problem in both deterministic and stochastic scenarios; the objective is to find the best paths for a fleet of vehicles, with the aim of visiting a set of targets. Based on the Cooperative Receding Horizon approach proposed in [4] for the Euclidean case, this paper i) develop a routing algorithm for graph-represented mission spaces, ii) presents a switching algorithm, which is able to dynamically change the vehicle behaviour according to the time-variable configuration of both vehicles and targets, as well as to handle the discovery of unknown targets. Simulations show the algorithm effectiveness.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://hdl.handle.net/11573/656474 http://hdl.handle.net/11573/656474]<br />
<br />
* [http://xplorestaging.ieee.org/ielx7/6940139/6961315/06961400.pdf?arnumber=6961400 http://xplorestaging.ieee.org/ielx7/6940139/6961315/06961400.pdf?arnumber=6961400],<br />
: [http://dx.doi.org/10.1109/med.2014.6961400 http://dx.doi.org/10.1109/med.2014.6961400]<br />
<br />
* [https://ieeexplore.ieee.org/document/6961400 https://ieeexplore.ieee.org/document/6961400],<br />
: [https://dblp.uni-trier.de/db/conf/med/med2014.html#ChiniPOPG14 https://dblp.uni-trier.de/db/conf/med/med2014.html#ChiniPOPG14],<br />
: [https://academic.microsoft.com/#/detail/2043953910 https://academic.microsoft.com/#/detail/2043953910]</div>Scipediacontent