Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
From MaRDI portal
Publication:548680
DOI10.1007/s10288-011-0153-0zbMath1221.90077OpenAlexW2153278891MaRDI QIDQ548680
Olli Bräysy, Amir Salehipour, Kenneth Sörensen, Peter 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
GRASPvariable neighborhood searchvariable neighborhood descentminimum latency problemtraveling repairman problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (33)
Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP ⋮ A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ Heuristics for the traveling repairman problem with profits ⋮ 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 POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ Variable neighborhood search for the travelling deliveryman problem ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing 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 ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem ⋮ A survey on optimization metaheuristics ⋮ Minimizing latency in post-disaster road clearance operations ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach ⋮ Optimisation of maintenance routing and scheduling for offshore wind farms ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ 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 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 efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ The multi-depot \(k\)-traveling repairman problem ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem ⋮ Solving the traveling delivery person problem with limited computational time
Cites Work
- Unnamed Item
- Polynomial time algorithms for some minimum latency problems
- Exact algorithms for the minimum latency problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A new formulation for the traveling deliveryman problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- The minimum latency problem
- The complexity of the travelling repairman problem
- The Delivery Man Problem and Cumulative Matroids
- A note on the traveling repairman problem
- A GRASP for the Vehicle Routing Problem with Time Windows
- The traveling salesman problem with cumulative costs
- A heuristic for the vehicle routing problem with time windows
- Variable neighborhood search: Principles and applications
This page was built for publication: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
