Integer linear programming models for a cement delivery problem

DOI10.1016/j.ejor.2012.04.039zbMath1253.90045OpenAlexW2048845889MaRDI QIDQ1926974

Alain Hertz, Marino Widmer, Marc Uldry

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.039

zbMATH Keywords

vehicle routinginteger linear programssplit deliveries

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items

The concrete delivery problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis, modeling and solution of the concrete delivery problem
• Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
• The vehicle routing problem: An overview of exact and approximate algorithms
• Vehicle routing with split deliveries
• Routing helicopters for crew exchanges on off-shore locations
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Savings by Split Delivery Routing
• Split-delivery routeing heuristics in livestock feed distribution
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results