Uso de optimización de mallas variables para el “viajante de comercio”
Loading...
Date
2018
Journal Title
Journal ISSN
Volume Title
Publisher
Corporación Universitaria Lasallista, Editorial Lasallista
Abstract
Introduction This paper presents a
proposal to apply the meta-heuristic
Optimization Based on Variable Meshes
(VMO) to the discreet problem of the
Traveler Seller (TSP); This model
explores the search space to Objective
from a population of solutions called
mesh that expands and contracts in
order to find good quality solutions. In
this context, the expansion operator
is modified in such a way that it is
applicable in a discrete domain, making
combinations among the solutions in
order to obtain new nodes. Another
element that is modified is the clearing
operator, which is responsible for
maintaining the diversity of the mesh in
each interaction. Methodology. A study
of VMO model parameters is summarized
in this paper, using a set of TSP instances
with different characteristics; In addition,
it can be observed that the proposal of
this work obtains competitive results
when compared with other international
reference algorithms mentioned in the
state of the art. The work is structured
as follows: Section 1 describes the
fundamental aspects of the TSP study
problem. Then, in the second, the general
functioning of VMO is explained, in the
third one, each of the expansion and
contraction operators is defined for the
study problem. Later in the fourth section
a study of the parameters of the proposal
and an experimental comparative
analysis with the results obtained with
other algorithms mentioned in the state
of the art is made. Conclusions Other
operators of generation of new nodes
were applied in the expansion process,
where a combination of solutions is made
in order to comply with the restrictions
imposed by the problem.
Description
Keywords
Corporación Universitaria Lasallista, Sistemas de información, Heurística, Algoritmos
Citation
Revista Lasallista de Investigación Vol. 15 No 2 2018