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

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Downloads

Abstract

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.
Original languageEnglish
Title of host publication6th International Mediterranean Science and Engineering Congress (IMSEC 2021)
Subtitle of host publicationproceedings book
EditorsMustafa Özcanlı, Hasan Serin, Ahmet Çalık
PublisherIMSEC
Pages25-25
Number of pages1
ISBN (Electronic)978605XXXXX21
Publication statusPublished - 2021
Event6th International Mediterranean Science and Engineering Congress - Alanya, Turkey
Duration: 25 Oct 202127 Oct 2021

Conference

Conference6th International Mediterranean Science and Engineering Congress
Abbreviated titleIMSEC 2021
Country/TerritoryTurkey
CityAlanya
Period25/10/2127/10/21

Keywords

  • Sectorization
  • Traveling salesman problem
  • Mixed integer linear programming
  • Solvers
  • Intlinprog
  • Pymoo

Fingerprint

Dive into the research topics of 'A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization'. Together they form a unique fingerprint.

Cite this