Diseño e implementación de una meta-heurística multi-poblacional de optimización combinatoria enfocada a la resolución de problemas de asignación de rutas a vehículos

03/24/2020
by   Eneko Osaba, et al.
0

Transportation is an essential area in the nowadays society, both for business sector and citizenry. There are different kinds of transportation systems, each one with its own characteristics. In the same way, various areas of knowledge can deal efficiently with the transport planning. The majority of the problems related with the transport and logistics have common characteristics, so they can be modeled as optimization problems, being able to see them as special cases of other generic problems. These problems fit into the combinatorial optimization field. Much of the problems of this type have an exceptional complexity. A great amount of meta-heuristics can be found the literature, each one with its advantages and disadvantages. Due to the high complexity of combinatorial optimization problems, there is no technique able to solve all these problems optimally. This fact makes the fields of combinatorial optimization and vehicle routing problems be a hot topic of research. This doctoral thesis will focus its efforts on developing a new meta-heuristic to solve different kind of vehicle routing problems. The presented technique offers an added value compared to existing methods, either in relation to the performance, and the contribution of conceptual originality. With the aim of validating the proposed model, the results obtained by the developed meta-heuristic have been compared with the ones obtained by other four algorithms of similar philosophy. Four well-known routing problems have been used in this experimentation, as well as two classical combinatorial optimization problems. In addition to the comparisons based on parameters such as the mean, or the standard deviation, two different statistical tests have been carried out. Thanks to these tests it can be affirmed that the proposed meta-heuristic is competitive in terms of performance and conceptual originality.

READ FULL TEXT

page 30

page 36

research
07/07/2012

Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms

Combinatorial optimization is widely applied in a number of areas nowada...
research
10/02/2018

Heuristic Optimization of Electrical Energy Systems: A Perpetual Motion Scheme and Refined Metrics to Compare the Solutions

Many optimization problems admit a number of local optima, among which t...
research
12/15/2022

Learning to repeatedly solve routing problems

In the last years, there has been a great interest in machine-learning-b...
research
05/15/2020

MineReduce: an approach based on data mining for problem size reduction

Hybrid variations of metaheuristics that include data mining strategies ...
research
09/22/2013

A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise

The aim of this work is to present a meta-heuristically approach of the ...
research
08/27/2012

Sensitive Ants in Solving the Generalized Vehicle Routing Problem

The idea of sensitivity in ant colony systems has been exploited in hybr...
research
07/07/2013

Fuzzy Integer Linear Programming Mathematical Models for Examination Timetable Problem

ETP is NP Hard combinatorial optimization problem. It has received treme...

Please sign up or login with your details

Forgot password? Click here to reset