A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
From MaRDI portal
Publication:1782165
DOI10.1016/j.cor.2018.07.021zbMath1458.90130OpenAlexW2884450616WikidataQ129474652 ScholiaQ129474652MaRDI QIDQ1782165
Zhuo Fu, Meng Qiu, Qiong Tang, Richard W. Eglese
Publication date: 18 September 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/126664/1/TSforVRPDSPDP_Acepted_by_COR.pdf
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, Synchronized truck and drone routing under disastrous conditions (case study: urban thoroughfares disinfection), Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms, Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit, Tabu search exploiting local optimality in binary optimization, Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem, A hybrid algorithm for time-dependent vehicle routing problem with time windows, The split delivery vehicle routing problem with three-dimensional loading constraints, 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, Optimal budget allocation policy for tabu search in stochastic simulation optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Separable programming/duality approach to solving the multi-product Newsboy/Gardener problem with linear constraints
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Improved lower bounds for the split delivery vehicle routing problem
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- Vehicle routing with backhauls: review and research perspectives
- New exact solution approaches for the split delivery vehicle routing problem
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- A new tabu search algorithm for the vehicle routing problem with backhauls
- 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
- A hybrid VND method for the split delivery vehicle routing problem
- A novel approach to solve the split delivery vehicle routing problem
- Split delivery routing
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
- The Split Delivery Vehicle Routing Problem: A Survey
- Savings by Split Delivery Routing
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- The vehicle-routing problem with delivery and back-haul options
- Vehicle routing problems with split deliveries
- AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
- A Method for Solving Traveling-Salesman Problems
- Vehicle routing problem with simultaneous deliveries and pickups
- Computer Solutions of the Traveling Salesman Problem
- A column generation approach for the split delivery vehicle routing problem
