Heuristics for the Traveling Repairman Problem with Profits

DOI10.4230/OASIcs.ATMOS.2010.34zbMath1247.90291OpenAlexW1572313895MaRDI QIDQ2917285

Frits C. R. Spieksma, Thijs Dewilde, Sofie Coene, Pieter Vansteenwegen, Dirk G. Cattrysse

Publication date: 28 September 2012

Full work available at URL: https://doi.org/10.4230/oasics.atmos.2010.34

zbMATH Keywords

tabu searchlatencyprofitstraveling repairmanrelief efforts

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A simple and effective metaheuristic for the minimum latency problem

Uses Software

• TSPLIB
• Concorde