Publicação
A hybrid approach GABC-LS to solve mTSP
| Resumo: | The Multiple Traveling Salesman Problem (mTSP) is an interesting combinatorial optimization problem due to its numerous real-life applications. It is a problem where m salesmen visit a set of n cities so that each city is visited once. The primary purpose is to minimize the total distance traveled by all salesmen. This paper presents a hybrid approach called GABC-LS that combines an evolutionary algorithm with the swarm intelligence optimization ideas and a local search method. The proposed approach was tested on two instances and produced some better results than the best-known solutions reported in the literature. |
|---|---|
| Autores principais: | Pereira, Sílvia de Castro |
| Outros Autores: | Pires, Eduardo J. Solteiro; Oliveira, Paulo B. de Moura |
| Assunto: | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| Ano: | 2022 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| _version_ | 1867173295436070912 |
|---|---|
| author | Pereira, Sílvia de Castro |
| author2 | Pires, Eduardo J. Solteiro Oliveira, Paulo B. de Moura |
| author2_role | author author |
| author_facet | Pereira, Sílvia de Castro Pires, Eduardo J. Solteiro Oliveira, Paulo B. de Moura |
| author_role | author |
| contributor_name_str_mv | Biblioteca Digital do IPB |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Pereira, Sílvia de Castro\"},{\"Person.name\":\"Pires, Eduardo J. Solteiro\"},{\"Person.name\":\"Oliveira, Paulo B. de Moura\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Biblioteca Digital do IPB |
| datacite.creators.creator.creatorName.fl_str_mv | Pereira, Sílvia de Castro Pires, Eduardo J. Solteiro Oliveira, Paulo B. de Moura |
| datacite.date.Accepted.fl_str_mv | 2022-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2023-02-27T12:12:47Z |
| datacite.date.embargoed.fl_str_mv | 2023-02-27T12:12:47Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_16ec |
| datacite.subjects.subject.fl_str_mv | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| datacite.titles.title.fl_str_mv | A hybrid approach GABC-LS to solve mTSP |
| dc.contributor.none.fl_str_mv | Biblioteca Digital do IPB |
| dc.creator.none.fl_str_mv | Pereira, Sílvia de Castro Pires, Eduardo J. Solteiro Oliveira, Paulo B. de Moura |
| dc.date.Accepted.fl_str_mv | 2022-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2023-02-27T12:12:47Z |
| dc.date.embargoed.fl_str_mv | 2023-02-27T12:12:47Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10198/27224 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Springer |
| dc.rights.cclincense.fl_str_mv | http://creativecommons.org/licenses/by/4.0/ |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_16ec |
| dc.subject.none.fl_str_mv | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| dc.title.fl_str_mv | A hybrid approach GABC-LS to solve mTSP |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_5794 |
| description | The Multiple Traveling Salesman Problem (mTSP) is an interesting combinatorial optimization problem due to its numerous real-life applications. It is a problem where m salesmen visit a set of n cities so that each city is visited once. The primary purpose is to minimize the total distance traveled by all salesmen. This paper presents a hybrid approach called GABC-LS that combines an evolutionary algorithm with the swarm intelligence optimization ideas and a local search method. The proposed approach was tested on two instances and produced some better results than the best-known solutions reported in the literature. |
| dirty | 0 |
| eu_rights_str_mv | restrictedAccess |
| format | conferencePaper |
| fulltext.url.fl_str_mv | https://bibliotecadigital.ipb.pt/bitstreams/2e97344c-5c4c-4115-ad32-9180b43312ff/download |
| funding.funder.alternateName_str_mv | FCT |
| funding.funder.identifier_str_mv | http://doi.org/10.13039/501100001871 |
| funding.funder.name_str_mv | Fundação para a Ciência e a Tecnologia |
| funding.name_str_mv | 6817 - DCRRNI ID |
| id | ipb_3dd189f72060e22e91a3cea4ee43cd05 |
| identifier.url.fl_str_mv | http://hdl.handle.net/10198/27224 |
| instacron_str | ipb |
| institution | Instituto Politécnico de Bragança |
| instname_str | Instituto Politécnico de Bragança |
| language | eng |
| network_acronym_str | ipb |
| network_name_str | Biblioteca Digital do IPB |
| oai_identifier_str | oai:bibliotecadigital.ipb.pt:10198/27224 |
| organization_str_mv | urn:organizationAcronym:ipb |
| person_str_mv | Pereira, Sílvia de Castro Pereira, Sílvia de Castro https://www.ciencia-id.pt/FF13-0CFA-02E3 FF13-0CFA-02E3 Pires, Eduardo J. Solteiro Oliveira, Paulo B. de Moura |
| publishDate | 2022 |
| publisher.none.fl_str_mv | Springer |
| reponame_str | Biblioteca Digital do IPB |
| repository_id_str | urn:repositoryAcronym:ipb |
| service_str_mv | urn:repositoryAcronym:ipb |
| spelling | engSpringerpt_PTThe Multiple Traveling Salesman Problem (mTSP) is an interesting combinatorial optimization problem due to its numerous real-life applications. It is a problem where m salesmen visit a set of n cities so that each city is visited once. The primary purpose is to minimize the total distance traveled by all salesmen. This paper presents a hybrid approach called GABC-LS that combines an evolutionary algorithm with the swarm intelligence optimization ideas and a local search method. The proposed approach was tested on two instances and produced some better results than the best-known solutions reported in the literature.application/pdfpt_PTA hybrid approach GABC-LS to solve mTSPPersonalPereira, Sílvia de CastroDSpacehttp://dspace.org/items/9e4fc9ce-02bf-4e38-946d-f950108753c4DSpacehttp://dspace.org/items/9e4fc9ce-02bf-4e38-946d-f950108753c4PereiraSílvia de CastroCiência IDhttps://www.ciencia-id.ptFF13-0CFA-02E3Pires, Eduardo J. SolteiroOliveira, Paulo B. de MouraHostingInstitutionOrganizationalBiblioteca Digital do IPBe-mailmailto:dspace@ipb.ptdspace@ipb.ptISBNIsPartOf978-3-031-23236-7ISSNIsPartOf1865-0929DOIIsPartOf10.1007/978-3-031-23236-7_362023-02-27T12:12:47Z20222022-01-01T00:00:00ZHandlehttp://hdl.handle.net/10198/27224http://purl.org/coar/access_right/c_16ecrestricted accessMultiple traveling salesman problemGenetic algorithmArtificial bee colonyLocal search426185 bytesFundação para a Ciência e a TecnologiaINESC TEC- Institute for Systems and Computer Engineering, Technology and Science6817 - DCRRNI IDCrossref Funder IDhttp://doi.org/10.13039/501100001871other research producthttp://purl.org/coar/resource_type/c_5794conference paper2022http://creativecommons.org/licenses/by/4.0/http://purl.org/coar/access_right/c_16ecapplication/pdffulltexthttps://bibliotecadigital.ipb.pt/bitstreams/2e97344c-5c4c-4115-ad32-9180b43312ff/downloadOL2A: International Conference on Optimization, Learning Algorithms and Applications 2022113Póvoa de Varzim |
| spellingShingle | A hybrid approach GABC-LS to solve mTSP Pereira, Sílvia de Castro Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| status | SINGLETON |
| subject.fl_str_mv | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| title | A hybrid approach GABC-LS to solve mTSP |
| title_full | A hybrid approach GABC-LS to solve mTSP |
| title_fullStr | A hybrid approach GABC-LS to solve mTSP |
| title_full_unstemmed | A hybrid approach GABC-LS to solve mTSP |
| title_short | A hybrid approach GABC-LS to solve mTSP |
| title_sort | A hybrid approach GABC-LS to solve mTSP |
| topic | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| topic_facet | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| url | http://hdl.handle.net/10198/27224 |
| visible | 1 |