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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A real-world newspaper distribution problem with recycling policy is tackledin this work. In order to meet all the complex restrictions contained in such aproblem, it has been modeled as a rich vehicle routing problem, which can bemore specifically considered as an asymmetric and clustered vehicle routingproblem with simultaneous pickup and deliveries, variable costs and forbiddenpaths (AC-VRP-SPDVCFP). This is the first study of such a problem in theliterature. For this reason, a benchmark composed by 15 instances has been alsoproposed. In the design of this benchmark, real geographical positions havebeen used, located in the province of Bizkaia, Spain. For the proper treatmentof this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed.This application is the first application of the firefly algorithm to any richvehicle routing problem. To prove that the proposed DFA is a promisingtechnique, its performance has been compared with two other well-knowntechniques: an evolutionary algorithm and an evolutionary simulated annealing.Our results have shown that the DFA has outperformed these two classicmeta-heuristics.

A Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem Modelling a Newspaper Distribution System with Recycling Policy