A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization

Aydin Teymourifar*, Ana Maria Rodrigues, José Soeiro Ferreira

*Autor correspondente para este trabalho

Resultado de pesquisa

Resumo

This study involves the division of a region into smaller units, based on sectorization, and a route determination for each of them. The routing problem of each unit is defined as a basic traveling salesman problem (TSP). Different implementations of a widely used method to solve TSP are compared. The method is based on a mixed-integer linear programming model, in which after finding an initial solution, a sub-tour elimination process is done iteratively. The implements of the method use some metaheuristics and solvers, which are available in libraries and toolboxes of MATLAB and Python. The implementations are compared in terms of results and solution times. Suggestions to solve large-scale problems are presented, which are derived from the results.
Idioma originalEnglish
Título da publicação do anfitrião6th International Mediterranean Science and Engineering Congress (IMSEC 2021)
Subtítulo da publicação do anfitriãoproceedings book
EditoresMustafa Özcanlı, Hasan Serin, Ahmet Çalık
EditoraIMSEC
Páginas25-25
Número de páginas1
ISBN (eletrónico)978605XXXXX21
Estado da publicaçãoPublished - 2021
Evento6th International Mediterranean Science and Engineering Congress - Alanya
Duração: 25 out 202127 out 2021

Conferência

Conferência6th International Mediterranean Science and Engineering Congress
Título abreviadoIMSEC 2021
País/TerritórioTurkey
CidadeAlanya
Período25/10/2127/10/21

Impressão digital

Mergulhe nos tópicos de investigação de “A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization“. Em conjunto formam uma impressão digital única.

Citação