Heuristics for the traveling repairman problem with profits
From MaRDI portal
Publication:336352
DOI10.1016/J.COR.2013.01.003zbMATH Open1348.90634OpenAlexW2104454324MaRDI QIDQ336352FDOQ336352
Dirk Cattrysse, Sofie Coene, Pieter Vansteenwegen, Thijs Dewilde, Frits C. R. Spieksma
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
Recommendations
- Heuristics for the traveling repairman problem with profits
- Hybrid evolutionary search for the traveling repairman problem with profits
- 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
- The risk-averse traveling repairman problem with profits
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The orienteering problem: a survey
- Title not available (Why is that?)
- Variable neighborhood search
- An improved approximation ratio for the minimum latency problem
- The minimum latency problem
- The complexity of the travelling repairman problem
- Handbook of metaheuristics
- Profit-based latency problems on the line
- Time‐dependent traveling salesman problem–the deliveryman case
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- The maximum collection problem with time-dependent rewards
- Exact algorithms for the minimum latency problem
Cited In (23)
- The complexity of the travelling repairman problem
- Optimisation of maintenance routing and scheduling for offshore wind farms
- The risk-averse traveling repairman problem with profits
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- New formulations and solution approaches for the latency location routing problem
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Multiobjective evolutionary algorithms for strategic deployment of resources in operational units
- 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
- Hybrid evolutionary search for the traveling repairman problem with profits
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
- 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
- An online optimization approach for post-disaster relief distribution with online blocked edges
- A sorting based efficient heuristic for pooled repair shop designs
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Robust Team Orienteering Problem with Decreasing Profits
- Minimizing latency in post-disaster road clearance operations
This page was built for publication: Heuristics for the traveling repairman problem with profits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336352)
