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

This work is motivated by solving a problem faced by big agriculturecompanies implementing precision agriculture operations for spraying practicesusing two types of operators, namely a tender tanker and a fleet of sprayers.We model this problem as a vehicle routing problem with multiplesynchronization constraints and multiple trips with the objective of minimizingthe waiting time of the sprayers and the total routing distance of thesprayers. The resulting mixed integer programming model that we develop is hardto solve using a commercial solver, owing to the dependencies caused by thespatio-temporal synchronization between the two operators. To solve large-scaleinstances effectively, we present an adaptive large neighborhood searchmetaheuristic that uses an intensive local search mechanism. We conduct anextensive computational analysis to assess the effectiveness of our solutionapproach and gain managerial insights into the problem by analyzing variousmodels. The proposed metaheuristic yields high-quality solutions quickly, withan overall average improvement of 5.61% over what is implemented in practiceimplying significant savings in time and cost.

Adaptive Large Neighborhood Search Metaheuristic for Vehicle Routing Problem with Multiple Synchronization Constraints and Multiple Trips