Heuristics for the traveling repairman problem with profits
From MaRDI portal
(Redirected from Publication:336352)
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
Cites work
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An improved approximation ratio for the minimum latency problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Exact algorithms for the minimum latency problem
- Handbook of metaheuristics
- Metaheuristics. From design to implementation.
- Profit-based latency problems on the line
- The complexity of the travelling repairman problem
- The maximum collection problem with time-dependent rewards
- The minimum latency problem
- The orienteering problem: a survey
- The traveling salesman problem. A computational study.
- Time‐dependent traveling salesman problem–the deliveryman case
- Variable neighborhood search
Cited in
(25)- The complexity of the travelling repairman problem
- Optimisation of maintenance routing and scheduling for offshore wind farms
- Mathematical models and heuristics for double-load crane scheduling in slab yards
- Heuristics for the traveling repairman problem with profits
- 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
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- New formulations and solution approaches for the latency location routing problem
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
- 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
- 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
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- 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
- Minimizing latency in post-disaster road clearance operations
- Robust Team Orienteering Problem with Decreasing Profits
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)
