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

Transportation is an essential area in the nowadays society, both forbusiness sector and citizenry. There are different kinds of transportationsystems, each one with its own characteristics. In the same way, various areasof knowledge can deal efficiently with the transport planning. The majority ofthe problems related with the transport and logistics have commoncharacteristics, so they can be modeled as optimization problems, being able tosee them as special cases of other generic problems. These problems fit intothe combinatorial optimization field. Much of the problems of this type have anexceptional complexity. A great amount of meta-heuristics can be found theliterature, each one with its advantages and disadvantages. Due to the highcomplexity of combinatorial optimization problems, there is no technique ableto solve all these problems optimally. This fact makes the fields ofcombinatorial optimization and vehicle routing problems be a hot topic ofresearch. This doctoral thesis will focus its efforts on developing a newmeta-heuristic to solve different kind of vehicle routing problems. Thepresented technique offers an added value compared to existing methods, eitherin relation to the performance, and the contribution of conceptual originality.With the aim of validating the proposed model, the results obtained by thedeveloped meta-heuristic have been compared with the ones obtained by otherfour algorithms of similar philosophy. Four well-known routing problems havebeen used in this experimentation, as well as two classical combinatorialoptimization problems. In addition to the comparisons based on parameters suchas the mean, or the standard deviation, two different statistical tests havebeen carried out. Thanks to these tests it can be affirmed that the proposedmeta-heuristic is competitive in terms of performance and conceptualoriginality.

Dise\~no e implementaci\'on de una meta-heur\'istica multi-poblacional  de optimizaci\'on combinatoria enfocada a la resoluci\'on de problemas de  asignaci\'on de rutas a veh\'iculos