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 are concerned with the automated exchange of orders betweenlogistics companies in a marketplace platform to optimize total revenues. Weintroduce a novel multi-agent approach to this problem, focusing on theCollaborative Vehicle Routing Problem (CVRP) through the lens of individualrationality. Our proposed algorithm applies the principles of Vehicle RoutingProblem (VRP) to pairs of vehicles from different logistics companies,optimizing the overall routes while considering standard VRP constraints plusindividual rationality constraints. By facilitating cooperation among competinglogistics agents through a Give-and-Take approach, we show that it is possibleto reduce travel distance and increase operational efficiency system-wide. Moreimportantly, our approach ensures individual rationality and fasterconvergence, which are important properties of ensuring the long-termsustainability of the marketplace platform. We demonstrate the efficacy of ourapproach through extensive experiments using real-world test data from majorlogistics companies. The results reveal our algorithm's ability to rapidlyidentify numerous optimal solutions, underscoring its practical applicabilityand potential to transform the logistics industry.

Individually Rational Collaborative Vehicle Routing through Give-And-Take Exchanges