English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Unmanned aerial vehicles (UAVs) are aircraft whose flights can be fullyautonomous without any provision for human intervention. One of the most usefuland promising domains where UAVs can be employed is natural disastermanagement.  In this paper, we focus on an emergency scenario and propose the use of afleet of UAVs that help rescue teams to individuate people needing help insidean affected area. We model this situation as an original graph theoreticalproblem called Multi-Depot Multi-Trip Vehicle Routing Problem with TotalCompletion Times minimization (MDMT-VRP-TCT); we go through some problemsalready studied in the literature that appear somehow similar to it andhighlight the differences, propose a mathematical formulation for our problemas a MILP, design a matheuristic framework to quickly solve large instances,and experimentally test its performance. Beyond the proposed application, oursolution works in any case in which a multi-depot multi-trip vehicle routingproblem must be solved.

Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization