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

This paper compares two methods to solve the classic problem of vehicle routing (VRP), well known for its acronym in English (Vehicle Routing Problem), introduced by Dantzig and Ramser in 1959, which is to minimize the cost to distribute the goods from one warehouse to a set of clients, which uses an accurate method of linear programming and goal heuristic based on genetic algorithms. The object of comparison is the benchmark problem developed by Christofides (1976). In the comparison will be considered historically the best results to date and those obtained in the development of this paper.

Solución al Problema de Ruteo de Vehículos Empleando Algoritmo Genético