Heuristics for the traveling repairman problem with profits

DOI10.1016/j.cor.2013.01.003zbMath1348.90634OpenAlexW2104454324MaRDI QIDQ336352

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

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/2052026

zbMATH Keywords

tabu searchlatencytraveling repairman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (20)

Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation ⋮ New formulations and solution approaches for the latency location routing problem ⋮ Robust Team Orienteering Problem with Decreasing Profits ⋮ A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Minimizing latency in post-disaster road clearance operations ⋮ Optimisation of maintenance routing and scheduling for offshore wind farms ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach ⋮ An adaptive large neighborhood search approach for multiple traveling repairman problem with profits ⋮ Multiobjective evolutionary algorithms for strategic deployment of resources in operational units ⋮ A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ A metaheuristic for the delivery man problem with time windows ⋮ The risk-averse traveling repairman problem with profits ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• The orienteering problem: a survey
• Exact algorithms for the minimum latency problem
• Profit-based latency problems on the line
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• An improved approximation ratio for the minimum latency problem
• Variable neighborhood search
• The minimum latency problem
• The complexity of the travelling repairman problem
• Time‐dependent traveling salesman problem–the deliveryman case
• The maximum collection problem with time-dependent rewards
• Handbook of metaheuristics

This page was built for publication: Heuristics for the traveling repairman problem with profits