Exportar Publicação

A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.

Exportar Referência (APA) 
L. Gouveia, Paias, Ana & Ponte, M. (2025). A Matheuristic for the Traveling Salesman Problem with positional consistency. European Conference on Operational Research.
Exportar Referência (IEEE) 
L. Gouveia et al.,  "A Matheuristic for the Traveling Salesman Problem with positional consistency", in European Conf. on Operational Research, Leeds, 2025
Exportar BibTeX 
@misc{gouveia2025_1773403664545,
	author = "L. Gouveia and Paias, Ana and Ponte, M.",
	title = "A Matheuristic for the Traveling Salesman Problem with positional consistency",
	year = "2025",
	url = "https://euro2025leeds.uk/"
}
Exportar RIS 
TY  - CPAPER
TI  - A Matheuristic for the Traveling Salesman Problem with positional consistency
T2  - European Conference on Operational Research
AU  - L. Gouveia
AU  - Paias, Ana
AU  - Ponte, M.
PY  - 2025
CY  - Leeds
UR  - https://euro2025leeds.uk/
AB  - We propose a matheuristic for the Traveling Salesman Problem with
positional consistency constraints, where we seek to generate a set of
routes with minimum total cost, in which the nodes visited in more than
one route (consistent nodes) must occupy the same relative position in
all their visits. The matheuristic is an Iterated Local Search-based algorithm that uses a restricted version of the problem under study, where
the positions of consistent nodes are fixed, to significantly improve the
quality of local optima found by the local search. Computational results show that, for instances with 48-76 nodes and 5 routes, or 96-171
nodes and 10 routes, the matheuristic can obtain, in short computational times, significantly better solutions than an exact method in 10
hours, obtaining optimal or near optimal solutions for instances where
the optimal solution is known.
ER  -