Exact solution methods for the multi-period vehicle routing problem with due dates
From MaRDI portal
Publication:2002858
DOI10.1016/j.cor.2019.05.026zbMath1458.90109OpenAlexW2947585677MaRDI QIDQ2002858
Publication date: 12 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.026
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items
Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes ⋮ Dynamic multi-period vehicle routing with touting ⋮ Flexible two-echelon location routing problem ⋮ The two-echelon production-routing problem
Uses Software
Cites Work
- A tabu search algorithm for the multi-period inspector scheduling problem
- Multi-period vehicle routing problem with due dates
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- The periodic vehicle routing problem with driver consistency
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- The flexible periodic vehicle routing problem
- The inventory-routing problem with transshipment
- The dynamic multi-period vehicle routing problem
- Minimizing the total cost in an integrated vendor-managed inventory system
- A Hybrid Heuristic for an Inventory Routing Problem
- Vehicle Routing
- Scheduling linen deliveries in a large hospital
- The period routing problem
- The Period Vehicle Routing Problem and its Extensions
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- A Matheuristic for the Multivehicle Inventory Routing Problem
- Networks and vehicle routing for municipal waste collection
- Formulations for an inventory routing problem
- The Vehicle Routing Problem with Release and Due Dates
