New exact solution approaches for the split delivery vehicle routing problem

DOI10.1007/s13675-017-0089-zzbMath1393.90015OpenAlexW2756316790MaRDI QIDQ1742903

Hande Yaman, Gizem Ozbaygin, Oya Ekin Karaşan

Publication date: 12 April 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/49822

zbMATH Keywords

valid inequalitiesvehicle routing problemextended formulationssplit deliveryexact approaches

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (5)

Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ A column generation-based heuristic for the split delivery vehicle routing problem with time windows ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints

Uses Software

• VRP

Cites Work

• 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
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
• A tabu search algorithm for the open vehicle routing problem
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• An adaptive memory algorithm for the split delivery vehicle routing problem
• Improved lower bounds for the split delivery vehicle routing problem
• A result on projection for the vehicle routing problem
• Vehicle routing with split deliveries
• Routing helicopters for crew exchanges on off-shore locations
• On the capacitated vehicle routing problem
• On capacitated network design cut-set polyhedra
• Projection results for vehicle routing
• A hybrid VND method for the split delivery vehicle routing problem
• Split delivery routing
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• A heuristic method for the open vehicle routing problem
• Savings by Split Delivery Routing
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A new tabu search heuristic for the open vehicle routing problem
• Vehicle routing problems with split deliveries
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• A column generation approach for the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem

This page was built for publication: New exact solution approaches for the split delivery vehicle routing problem