Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/97139
Title: | Finding K shortest and dissimilar paths | Authors: | Moghanni, Ali Pascoal, Marta Godinho, Maria Teresa |
Issue Date: | 2022 | Publisher: | Wiley | Project: | UID/Multi/00308/2019 CENTRO-01-0145-FEDER-029312 UIDB/00324/2020 |
Serial title, monograph or event: | International Transactions in Operational Research | Volume: | 29 | Issue: | 3 | Abstract: | The purpose of the K dissimilar paths problem is to find a set of K paths, between the same pair of nodes, which share few arcs. The problem has been addressed from an application point of view, and integer programming formulations have also been introduced recently. In the present work, it is assumed that each arc is assigned with a cost, and the goal is then to find K dissimilar paths while simultaneously minimizing the total cost. Some of the previous formulations: one minimizing the number of repeated arcs, another one minimizing the number of arc repetitions, as well as modifications that bound the number of paths in which the arcs appear, are extended with a cost function. Properties of the resulting biobjective problems are studied and the ϵ-constraint method is adapted to solve them using a decreasing and an increasing strategy for updating ϵ. These methods are tested for finding sets of 10 paths in random and grid instances to assess the efficiency of the ϵ-constraint methods and the performance of the formulations to calculate shortest and dissimilar paths. Results show that minimizing the number of arc repetitions produces efficient solutions with higher dissimilarities faster than minimizing the number of repeated arcs. The cost range of the solutions is similar in both approaches. Additionally, bounding the number of paths in which each arc appears improves the quality of the solutions as to the dissimilarity while worsening its cost. | URI: | https://hdl.handle.net/10316/97139 | DOI: | 10.1111/itor.13060 | Rights: | openAccess |
Appears in Collections: | I&D INESCC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MoghanniEtAlEGeral2021.pdf | 502.96 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
4
checked on May 1, 2023
WEB OF SCIENCETM
Citations
6
checked on Jun 2, 2024
Page view(s)
199
checked on Oct 9, 2024
Download(s)
105
checked on Oct 9, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.