Publication
The family traveling salesman problem
| datacite.subject.fos | Ciências Naturais::Matemáticas | pt_PT |
| dc.contributor.advisor | Paias, Ana Maria Duarte Silva Alves | |
| dc.contributor.author | Bernardino, Raquel | |
| dc.date.accessioned | 2020-03-11T16:00:49Z | |
| dc.date.available | 2020-03-11T16:00:49Z | |
| dc.date.issued | 2019-04 | |
| dc.description.abstract | Consider a depot, a partition of the set of nodes into subsets, called families, and a cost matrix. The objective of the family traveling salesman problem (FTSP) is to find the minimum cost circuit that starts and ends at the depot and visits a given number of nodes per family. The FTSP was motivated by the order picking problem in warehouses where products of the same type are stored in different places and it is a recent problem. Nevertheless, the FTSP is an extension of well-known problems, such as the traveling salesman problem. Since the benchmark instances available are in small number we developed a generator, which given a cost matrix creates an FTSP instance with the same cost matrix. We generated several test instances that are available in a site dedicated to the FTSP. We propose several mixed integer linear programming models for the FTSP. Additionally, we establish a theoretical and a practical comparison between them. Some of the proposed models have exponentially many constraints, therefore we developed a branch-and-cut (B&C) algorithm to solve them. With the B&C algorithm we were able to obtain the optimal value of open benchmark instances and of the majority of the generated instances. As the FTSP is an NP-hard problem we develop three distinct heuristic methods: a genetic algorithm, an iterated local search algorithm and a hybrid algorithm. With all of them we were able to improve the best upper bounds available in the literature for the benchmark instances that still have an unknown optimal value. We created a new variant of the FTSP, called the restricted family traveling salesman problem (RFTSP), in which nodes from the same family must be visited consecutively. We apply to the RFTSP the methods proposed for the FTSP and develop a new formulation based on the interfamily and the intrafamily relationships | pt_PT |
| dc.identifier.tid | 101527888 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10451/42303 | |
| dc.language.iso | eng | pt_PT |
| dc.subject | Family traveling salesman problem | pt_PT |
| dc.subject | Multicommodity flow | pt_PT |
| dc.subject | Projections | pt_PT |
| dc.subject | Branch-andcut algorithm | pt_PT |
| dc.subject | Metaheuristics | pt_PT |
| dc.title | The family traveling salesman problem | pt_PT |
| dc.type | doctoral thesis | |
| dspace.entity.type | Publication | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FMAT-NAN%2F2196%2F2014/PT | |
| oaire.fundingStream | 3599-PPCDT | |
| person.familyName | Bernardino | |
| person.givenName | Raquel | |
| person.identifier.ciencia-id | AE1A-E769-30FF | |
| person.identifier.orcid | 0000-0003-3289-2587 | |
| person.identifier.scopus-author-id | 57190756467 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | doctoralThesis | pt_PT |
| relation.isAuthorOfPublication | 1779866f-faed-4678-8cd9-c9a703914ef5 | |
| relation.isAuthorOfPublication.latestForDiscovery | 1779866f-faed-4678-8cd9-c9a703914ef5 | |
| relation.isProjectOfPublication | 26689eff-7abf-41cf-8aa1-991449e12c83 | |
| relation.isProjectOfPublication.latestForDiscovery | 26689eff-7abf-41cf-8aa1-991449e12c83 | |
| thesis.degree.name | Tese de doutoramento, Estatística e Investigação Operacional (Otimização), Universidade de Lisboa, Faculdade de Ciências, 2019 | pt_PT |