A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="http://downloads.hindawi.com/journals/complexity/2020/1047369.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation
<span title="2020-07-16">2020</span>
<i title="Hindawi Limited">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/y3fh56bfunh5fgneywwba6d4ke" style="color: black;">Complexity</a>
</i>
Preserved Fulltext
One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which require coordination using some fair and efficient task allocation method. In this paper, we review the literature on scalable and dynamic task allocation focusing on deterministic and dynamic two-dimensional linear assignment problems. We focus on multiagent
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2020/1047369">doi:10.1155/2020/1047369</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ctckxllr7fhxhlx2d67nqp2pkq">fatcat:ctckxllr7fhxhlx2d67nqp2pkq</a>
</span>
more »
... m representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks. We give a comparison and critical analysis of recent research results focusing on centralized, distributed, and decentralized solution approaches. Moreover, we propose mathematical models for dynamic versions of the following assignment problems well known in combinatorial optimization: the assignment problem, bottleneck assignment problem, fair matching problem, dynamic minimum deviation assignment problem, Σk-assignment problem, the semiassignment problem, the assignment problem with side constraints, and the assignment problem while recognizing agent qualification; all while considering the main aspect of open vehicle fleets: random arrival of tasks and vehicles (agents) that may become available after assisting previous tasks or by participating in the fleet at times based on individual interest.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200717234123/http://downloads.hindawi.com/journals/complexity/2020/1047369.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/16/26/1626cb8655e2268bae98518765b2417998816d45.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2020/1047369">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
hindawi.com
</button>
</a>