Heuristics for the Black and White Travelling Salesman Problem

Detalhes bibliográficos
Autor(a) principal: Henriques, Sofia Soares
Data de Publicação: 2022
Tipo de documento: Dissertação
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10451/55566
Resumo: Tese de mestrado, Estatística e Investigação Operacional (Investigação Operacional), 2022, Universidade de Lisboa, Faculdade de Ciências
id RCAP_fdabbc5eff81b002da5b3c2833420ff7
oai_identifier_str oai:repositorio.ul.pt:10451/55566
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Heuristics for the Black and White Travelling Salesman ProblemBlack and White Travelling Salesman ProblemOtimização combinatóriaMétodos heurísticosPesquisa local iteradaTeses de mestrado - 2022Departamento de Estatística e Investigação OperacionalTese de mestrado, Estatística e Investigação Operacional (Investigação Operacional), 2022, Universidade de Lisboa, Faculdade de CiênciasThe Black and White Travelling Salesman Problem (BWTSP) constitutes a variant of the Travelling Salesman Problem (TSP). Similarly to the TSP, it is formally defined on a directed graph with a set of vertices V , a set of arcs A and each arc has an associated cost. Each vertex from V is coloured as either black or white, thus V can be partitioned into two subsets W and B, the former containing all white nodes in V and the latter containing all the black ones. The objective of the BWTSP is to determine the Hamiltonian circuit with minimal cost in the graph which satisfies two conditions: it must not contain more than Q white nodes between two consecutive black vertices, and the total length between two consecutive black vertices must not exceed a value L. The BWTSP has real-life applications in the design of telecommunication networks and in the scheduling of aircraft operations. In the computational complexity theory, the BWTSP is classified as an NP-hard problem. This motivates the development of heuristic methods in order to obtain feasible solutions with an associated value close to the global optimum within a reasonable amount of computational time. Our goal is to develop heuristics which can be applied on both symmetric and asymmetric instances of the BWTSP, so that these methods can be used to solve more real-life problems. Due to the additional constraints of the BWTSP in comparison to the classical TSP, determining an initial feasible solution for a given instance of the problem is not a simple task, specially when the values of both parameters Q and L are tight. Therefore, we propose three constructive heuristics for the BWTSP in this dissertation. An Iterated Local Search (ILS) algorithm was proposed as an improvement heuristic. In order to justify our choice of parameters for the algorithm, we compared the performance of the ILS considering different combinations of parameters. Furthermore, we studied in more detail the performance of the ILS we proposed and analysed the differences regarding the quality of the final solutions between symmetric and asymmetric instances.Paias, Ana Maria Duarte Silva Alves, 1963-Repositório da Universidade de LisboaHenriques, Sofia Soares2023-01-03T10:03:47Z202220222022-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttp://hdl.handle.net/10451/55566enginfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-08T17:02:40Zoai:repositorio.ul.pt:10451/55566Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T22:06:14.284263Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Heuristics for the Black and White Travelling Salesman Problem
title Heuristics for the Black and White Travelling Salesman Problem
spellingShingle Heuristics for the Black and White Travelling Salesman Problem
Henriques, Sofia Soares
Black and White Travelling Salesman Problem
Otimização combinatória
Métodos heurísticos
Pesquisa local iterada
Teses de mestrado - 2022
Departamento de Estatística e Investigação Operacional
title_short Heuristics for the Black and White Travelling Salesman Problem
title_full Heuristics for the Black and White Travelling Salesman Problem
title_fullStr Heuristics for the Black and White Travelling Salesman Problem
title_full_unstemmed Heuristics for the Black and White Travelling Salesman Problem
title_sort Heuristics for the Black and White Travelling Salesman Problem
author Henriques, Sofia Soares
author_facet Henriques, Sofia Soares
author_role author
dc.contributor.none.fl_str_mv Paias, Ana Maria Duarte Silva Alves, 1963-
Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Henriques, Sofia Soares
dc.subject.por.fl_str_mv Black and White Travelling Salesman Problem
Otimização combinatória
Métodos heurísticos
Pesquisa local iterada
Teses de mestrado - 2022
Departamento de Estatística e Investigação Operacional
topic Black and White Travelling Salesman Problem
Otimização combinatória
Métodos heurísticos
Pesquisa local iterada
Teses de mestrado - 2022
Departamento de Estatística e Investigação Operacional
description Tese de mestrado, Estatística e Investigação Operacional (Investigação Operacional), 2022, Universidade de Lisboa, Faculdade de Ciências
publishDate 2022
dc.date.none.fl_str_mv 2022
2022
2022-01-01T00:00:00Z
2023-01-03T10:03:47Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10451/55566
url http://hdl.handle.net/10451/55566
dc.language.iso.fl_str_mv eng
language eng
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ório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799134614816555008

Registros relacionados