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

Bibliographic Details
Main Author: Teymourifar, Aydin
Publication Date: 2021
Other Authors: Rodrigues, Ana Maria, Ferreira, José Soeiro
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10400.14/38857
Summary: 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.
id RCAP_0c43f914ead61681f276cebd4617f729
oai_identifier_str oai:repositorio.ucp.pt:10400.14/38857
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorizationSectorizationTraveling salesman problemMixed integer linear programmingSolversIntlinprogPymooThis 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.VeritatiTeymourifar, AydinRodrigues, Ana MariaFerreira, José Soeiro2022-09-12T17:30:11Z20212021-01-01T00:00:00Zconference objectinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10400.14/38857eng978605XXXXX21info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-03-13T16:44:58Zoai:repositorio.ucp.pt:10400.14/38857Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T02:22:38.129883Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
title A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
spellingShingle A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
Teymourifar, Aydin
Sectorization
Traveling salesman problem
Mixed integer linear programming
Solvers
Intlinprog
Pymoo
title_short A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
title_full A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
title_fullStr A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
title_full_unstemmed A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
title_sort A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
author Teymourifar, Aydin
author_facet Teymourifar, Aydin
Rodrigues, Ana Maria
Ferreira, José Soeiro
author_role author
author2 Rodrigues, Ana Maria
Ferreira, José Soeiro
author2_role author
author
dc.contributor.none.fl_str_mv Veritati
dc.contributor.author.fl_str_mv Teymourifar, Aydin
Rodrigues, Ana Maria
Ferreira, José Soeiro
dc.subject.por.fl_str_mv Sectorization
Traveling salesman problem
Mixed integer linear programming
Solvers
Intlinprog
Pymoo
topic Sectorization
Traveling salesman problem
Mixed integer linear programming
Solvers
Intlinprog
Pymoo
description 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.
publishDate 2021
dc.date.none.fl_str_mv 2021
2021-01-01T00:00:00Z
2022-09-12T17:30:11Z
dc.type.driver.fl_str_mv conference object
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.14/38857
url http://hdl.handle.net/10400.14/38857
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 978605XXXXX21
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833601331449823232

Similar Items