The vehicle routing problem with demand range

DOI10.1007/s10479-006-0057-0zbMath1151.90349OpenAlexW2140862822MaRDI QIDQ867541

Ann Melissa Campbell

Publication date: 15 February 2007

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0057-0

zbMATH Keywords

flexibilitydelivery volume

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (1)

A tabu search heuristic for ship routing and scheduling with flexible cargo quantities

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the capacitated vehicle routing problem
• A method for solving ship routing problems with inventory constraints
• Modelling path flows for a combined ship routing and inventory management problem
• Vehicle routing with split deliveries
• Routing helicopters for crew exchanges on off-shore locations
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Split delivery routing
• Savings by Split Delivery Routing
• A Lower Bound for the Split Delivery Vehicle Routing Problem

This page was built for publication: The vehicle routing problem with demand range