A tabu search algorithm for the single vehicle routing allocation problem
From MaRDI portal
Recommendations
- A tabu search algorithm for the vehicle routing problem
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A tabu search algorithm for the open vehicle routing problem
- Tabu Search for Vehicle Routing Problems (VRPs)
- scientific article; zbMATH DE number 2209651
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- Tabu search algorithm for the discrete split delivery vehicle routing problem
- A reactive tabu search for the vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
Cited in
(11)- Variable neighbourhood search: Methods and applications
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- Spatial coverage in routing and path planning problems
- On Euclidean vehicle routing with allocation
- The generalized covering salesman problem
- Strong equilibria in the vehicle routing game
- Strong coalitional structure in an open vehicle routing game
- Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
- Variable neighbourhood search: methods and applications
This page was built for publication: A tabu search algorithm for the single vehicle routing allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512571)