An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
From MaRDI portal
(Redirected from Publication:5278232)
Recommendations
- A variable neighborhood search for solving the multi-vehicle covering tour problem
- The multi-vehicle cumulative covering tour problem
- Solving the multi-vehicle multi-covering tour problem
- The multi-vehicle probabilistic covering tour problem
- A multi‐vehicle covering tour problem with speed optimization
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Heuristics for the multi-vehicle covering tour problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
Cites work
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An effective VNS for the capacitated \(p\)-median problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
- Heuristics for the multi-vehicle covering tour problem
- The bi-objective covering tour problem
- The bi-objective stochastic covering tour problem
- The Covering Salesman Problem
- The Covering Tour Problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- The vehicle routing problem: An overview of exact and approximate algorithms
- Variable neighborhood search
- Variable neighborhood search for location routing
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- Variable neighbourhood search: Methods and applications
Cited in
(19)- Solving the multi-vehicle multi-covering tour problem
- The multi-vehicle cumulative covering tour problem
- Spatial coverage in routing and path planning problems
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Iterative column generation algorithm for generalized multi-vehicle covering tour problem
- Reactive GRASP for the prize-collecting covering tour problem
- scientific article; zbMATH DE number 2209648 (Why is no real title available?)
- The two‐echelon routing problem with truck and drones
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- A decision method on yard cranes transformation and deployment in green ports
- A flow-based model for the multivehicle covering tour problem with route balancing
- Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
- Generalized variable neighborhood search algorithm for vehicle routing problem with time windows and synchronization
- Exact algorithms and heuristics for the capacitated covering salesman problem
- The multi-vehicle probabilistic covering tour problem
- Multi-period heterogeneous fleet vehicle routing problem with self-pickup point selection: a last-mile delivery scenario in urban and rural areas
- A variable neighborhood search algorithm for the multimode set covering problem
This page was built for publication: An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278232)
