Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
From MaRDI portal
Publication:548680
DOI10.1007/S10288-011-0153-0zbMATH Open1221.90077OpenAlexW2153278891MaRDI QIDQ548680FDOQ548680
Olli Bräysy, Amir Salehipour, K. Sörensen, P. Goos
Publication date: 30 June 2011
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-011-0153-0
Recommendations
- An effective metaheuristic for multiple traveling repairman problem with distance constraints
- A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits
- Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Hybrid evolutionary search for the traveling repairman problem with profits
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
variable neighborhood searchminimum latency problemGRASPvariable neighborhood descenttraveling repairman problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A heuristic for the vehicle routing problem with time windows
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- The minimum latency problem
- Polynomial time algorithms for some minimum latency problems
- The complexity of the travelling repairman problem
- The Delivery Man Problem and Cumulative Matroids
- A note on the traveling repairman problem
- The traveling salesman problem with cumulative costs
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Title not available (Why is that?)
- Exact algorithms for the minimum latency problem
- A GRASP for the Vehicle Routing Problem with Time Windows
- A new formulation for the traveling deliveryman problem
Cited In (36)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
- Solving the traveling delivery person problem with limited computational time
- A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
- Optimisation of maintenance routing and scheduling for offshore wind farms
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- An effective metaheuristic for multiple traveling repairman problem with distance constraints
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
- Weighted online minimum latency problem with edge uncertainty
- Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens
- Heuristics for the traveling repairman problem with profits
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
- 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
- A branch-and-price algorithm for the minimum latency problem
- A survey on optimization metaheuristics
- Hybrid evolutionary search for the traveling repairman problem with profits
- Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- 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
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- A simple and effective metaheuristic for the minimum latency problem
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- Variable neighborhood search for the travelling deliveryman problem
- Minimizing latency in post-disaster road clearance operations
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
- The multi-depot \(k\)-traveling repairman problem
This page was built for publication: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548680)
