A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
type: Item
instance of: scholarly article
title: A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
zbMATH Open document ID: 1458.90130
author: Meng Qiu
author: Zhuo Fu
author: Qiong Tang
author: Richard Eglese
published in: Computers \& Operations Research
publication date: 2018-09-18T00:00:00Z
full work available at URL: TSforVRPDSPDP Acepted by COR.pdf
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6938895
zbMATH Keywords: routing
zbMATH Keywords: pickup and delivery
zbMATH Keywords: discrete split
zbMATH Keywords: tabu search
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2884450616
cites work: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
cites work: The vehicle-routing problem with delivery and back-haul options
cites work: A column generation approach for the split delivery vehicle routing problem
cites work: Branch-and-cut algorithms for the split delivery vehicle routing problem
cites work: The Split Delivery Vehicle Routing Problem: A Survey
cites work: Vehicle routing problems with split deliveries
cites work: A Lower Bound for the Split Delivery Vehicle Routing Problem
cites work: A randomized granular tabu search heuristic for the split delivery vehicle routing problem
cites work: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
cites work: A new tabu search algorithm for the vehicle routing problem with backhauls
cites work: Vehicle routing problem with simultaneous deliveries and pickups
cites work: A novel approach to solve the split delivery vehicle routing problem
cites work: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
cites work: A Method for Solving Traveling-Salesman Problems
cites work: Savings by Split Delivery Routing
cites work: Split delivery routing
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Q4532228
cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
cites work: Lasso solution strategies for the vehicle routing problem with pickups and deliveries
cites work: A hybrid VND method for the split delivery vehicle routing problem
cites work: Vehicle routing with backhauls: review and research perspectives
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
cites work: A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
cites work: Improved lower bounds for the split delivery vehicle routing problem
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
cites work: New exact solution approaches for the split delivery vehicle routing problem
cites work: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
cites work: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
cites work: Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
cites work: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
cites work: An iterated local search heuristic for the split delivery vehicle routing problem
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: Q2948889
cites work: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
cites work: Separable programming/duality approach to solving the multi-product Newsboy/Gardener problem with linear constraints
cites work: Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
Wikidata QID: Q129474652
DOI: 10.1016/J.COR.2018.07.021
description: scientific article; zbMATH DE number 6938895