New exact solution approaches for the split delivery vehicle routing problem
type: Item
instance of: scholarly article
title: New exact solution approaches for the split delivery vehicle routing problem
zbMATH Open document ID: 1393.90015
author: Gizem Ozbaygin
author: Oya Ekin Karasan
author: Hande Yaman
published in: EURO Journal on Computational Optimization
publication date: 2018-04-12T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/49822
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 6859036
zbMATH Keywords: split delivery
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: valid inequalities
zbMATH Keywords: extended formulations
zbMATH Keywords: exact approaches
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2756316790
cites work: A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
cites work: An adaptive memory algorithm for the split delivery vehicle routing problem
cites work: Vehicle routing problems with split deliveries
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: On capacitated network design cut-set polyhedra
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: A tabu search algorithm for the open vehicle routing problem
cites work: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
cites work: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
cites work: Savings by Split Delivery Routing
cites work: Split delivery routing
cites work: Vehicle routing with split deliveries
cites work: A new tabu search heuristic for the open vehicle routing problem
cites work: A result on projection for the vehicle routing problem
cites work: A hybrid VND method for the split delivery vehicle routing problem
cites work: Projection results for vehicle routing
cites work: The open vehicle routing problem: algorithms, large-scale test problems, and computational results
cites work: Improved lower bounds for the split delivery vehicle routing problem
cites work: Q4532225
cites work: On the capacitated vehicle routing problem
cites work: A heuristic method for the open vehicle routing problem
cites work: Routing helicopters for crew exchanges on off-shore locations
cites work: An iterated local search heuristic for the split delivery vehicle routing problem
DOI: 10.1007/S13675-017-0089-Z
Recommended article: A novel approach to solve the split delivery vehicle routing problem
Recommended article: The Split Delivery Vehicle Routing Problem: A Survey
Recommended article: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
Recommended article: An Overview on the Split Delivery Vehicle Routing Problem
Recommended article: Improved lower bounds for the split delivery vehicle routing problem
Recommended article: Branch-and-cut algorithms for the split delivery vehicle routing problem
Recommended article: A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
Recommended article: A hybrid VND method for the split delivery vehicle routing problem
Recommended article: Q2948889
Recommended article: Vehicle routing problems with split deliveries
description: scientific article; zbMATH DE number 6859036