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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The Flying Sidekick Traveling Salesman Problem (FSTSP) considers a deliverysystem composed by a truck and a drone. The drone launches from the truck witha single package to deliver to a customer. Each drone must return to the truckto recharge batteries, pick up another package, and launch again to a newcustomer location. This work proposes a novel Mixed Integer Programming (MIP)formulation and a heuristic approach to address the problem. The proposedMIPformulation yields better linear relaxation bounds than previously proposedformulations for all instances, and was capable of optimally solving severalunsolved instances from the literature. A hybrid heuristic based on the GeneralVariable Neighborhood Search metaheuristic combining Tabu Search concepts isemployed to obtain high-quality solutions for large-size instances. Theefficiency of the algorithm was evaluated on 1415 benchmark instances from theliterature, and over 80% of the best known solutions were improved.

Exact and Heuristic Approaches to Drone Delivery Problems