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

In this paper, we study novel variants of the well-known two-echelon vehiclerouting problem in which a truck works on the first echelon to transportparcels and a fleet of drones to intermediate depots while in the secondechelon, the drones are used to deliver parcels from intermediate depots tocustomers. The objective is to minimize the completion time instead of thetransportation cost as in classical 2-echelon vehicle routing problems.Depending on the context, a drone can be launched from the truck at anintermediate depot once (single trip drone) or several times (multiple tripdrone). Mixed Integer Linear Programming (MILP) models are first proposed toformulate mathematically the problems and solve to optimality small-sizeinstances. To handle larger instances, a metaheuristic based on the idea ofGreedy Randomized Adaptive Search Procedure (GRASP) is introduced. Experimentalresults obtained on instances of different contexts are reported and analyzed.

The two-echelon routing problem with truck and drones