.png){kind=icon}
.png){kind=icon}
Return
A matheuristic and a hybrid algorithm for the asymmetric period travelling salesman problem
.png){kind=icon}
PRE
AI
S
P
DOI：10.1016/j.ejor.2026.02.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study theoretical and empirical characteristics of a period-aggregated formulation for the Period Travelling Salesman Problem and propose a matheuristic based on this formulation. Additionally, we develop an Iterated Local Search algorithm and introduce a hybrid heuristic that combines elements from both approaches. We assess the computational performance of the three heuristics using both benchmark instances from the literature and a newly generated set of asymmetric instances, with up to 443 nodes and 5 periods. All proposed methods produced high-quality solutions. For large-scale instances, the matheuristic, enhanced with a simple local search procedure, was able to find the global optimum in many cases. In particular, it solved an asymmetric instance with 443 nodes and 5 periods to optimality within 10 minutes.
Keywords:
Combinatorial optimisation
Period travelling salesman problem
Iterated local search
Matheuristic
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers