A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
From MaRDI portal
Publication:1652352
DOI10.1016/j.cor.2017.03.009zbMath1458.90129OpenAlexW2601546063MaRDI QIDQ1652352
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.009
parallel computingvehicle routing problemvariable neighborhood searchdivisible deliveries and pickups
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Modelling and solving the milk collection problem with realistic constraints ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic ⋮ Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ A parallel variable neighborhood search for solving covering salesman problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- General solutions to the single vehicle routing problem with pickups and deliveries
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- Variable neighbourhood search: methods and applications
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- The travelling salesman problem with pick-up and delivery
- Variable neighborhood search
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- The parallel variable neighborhood search for the \(p\)-median problem
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- The single vehicle routing problem with deliveries and selective pickups
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Vehicle Routing Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
- Parallel Metaheuristics Applications
- The vehicle-routing problem with delivery and back-haul options
- Vehicle routing problems with split deliveries
- Parallel metaheuristics: recent advances and new trends
- A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
- AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
- Variable neighborhood search: Principles and applications
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
