Variable neighborhood search for the travelling deliveryman problem
From MaRDI portal
Publication:1942008
DOI10.1007/s10288-012-0212-1zbMath1268.90068OpenAlexW2077144156MaRDI QIDQ1942008
Dragan Urošević, Saïd Hanafi, Nenad Mladenović
Publication date: 25 March 2013
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-012-0212-1
combinatorial optimizationmetaheuristicsvariable neighborhood searchroutingtravelling deliveryman problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Two level general variable neighborhood search for attractive traveling salesman problem, A branch-and-price algorithm for the minimum latency problem, A general variable neighborhood search variants for the travelling salesman problem with draft limits, An online optimization approach for post-disaster relief distribution with online blocked edges, Routing multiple work teams to minimize latency in post-disaster road network restoration, In memory of Professor Nenad Mladenović (1951--2022), A performance study on multi improvement neighborhood search strategy, 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, 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, Solving the traveling repairman problem with profits: a novel variable neighborhood search approach, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, The multi-depot \(k\)-traveling repairman problem, Solving the traveling delivery person problem with limited computational time
Uses Software
Cites Work
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Exact algorithms for the minimum latency problem
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A new formulation for the traveling deliveryman problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- The time dependent traveling salesman problem: polyhedra and algorithm
- An efficient GVNS for solving Traveling Salesman Problem with Time Windows
- Sum-of-squares clustering on networks
- The Delivery Man Problem and Cumulative Matroids
- Dijkstra's interpretation of the approach to solving a problem of program correctness
