Pages that link to "Item:Q548680"
From MaRDI portal
The following pages link to Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680):
Displayed 31 items.
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
- Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Optimisation of maintenance routing and scheduling for offshore wind farms (Q1752172) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- Multiobjective evolutionary algorithms for strategic deployment of resources in operational units (Q2282564) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP (Q2629574) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)