Uma Análise Estatística de Estruturas de Vizinhança para o Problema do Caixeiro Viajante

Authors

  • Marcus V. F. Diadelmo Programa de Pós-Graduação em Engenharia Elétrica, Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, 31270-901, Belo Horizonte, MG, Brasil
  • Lucas S. Batista Departamento de Engenharia Elétrica, Operations Research and Complex Systems Laboratory (ORCS Lab.), Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, 31270-901, Belo Horizonte, MG, Brasil
  • Michel Bessani Departamento de Engenharia Elétrica, Operations Research and Complex Systems Laboratory (ORCS Lab.), Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, 31270-901, Belo Horizonte, MG, Brasil

Keywords:

TSP, VNS, Neighborhood Structures, Statistical Analysis

Abstract

The Traveling Salesman Problem (TSP) is a classic optimization problem in the literature, having several algorithms capable of working it. This study explores the Variable Neighborhood Search (VNS) algorithm, which requires neighborhood structures to address the problem. The purpose of the study is to verify, through statistical analysis, among some widely used structures in the literature, if there are significant differences in using one structure over others. The results suggest that one of the considered structures has a worse performance when compared to the others at a 95% confidence level.

Downloads

Published

2024-10-18

Issue

Vol. 4 No. 1 (2024): CBA2024

Section

Articles