An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach

DOI10.1016/j.orl.2020.04.007OpenAlexW2944926246MaRDI QIDQ2183219

Yanyan Li

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05557

zbMATH Keywords

dynamic programmingsplit deliverymultiple depotsnumber of vehicles

Mathematics Subject Classification ID

Combinatorics (05-XX) Operations research, mathematical programming (90-XX)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Thirty years of heterogeneous vehicle routing
• New benchmark instances for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• Vehicle Routing
• The Split Delivery Vehicle Routing Problem: A Survey
• Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
• Capacitated Vehicle Routing on Trees
• A column generation approach for the split delivery vehicle routing problem

This page was built for publication: An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach