Work

A matheuristic for the traveling salesman problem with positional consistency constraints

Year: 2025

Type: article

Abstract: 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 routes. 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–171 nodes and 5 or 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.

Source: International Transactions in Operational Research

DOI: 10.1111/itor.70125

Authors: Luís Gouveia, Ana Paias, Mafalda Ponte

Institutions: University of Lisbon, Iscte – Instituto Universitário de Lisboa

Language: English

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,030

Funder: Fundação para a Ciência e a Tecnologia