The dynamic-demand joint replenishment problem with approximated transportation costs
From MaRDI portal
Publication:1734353
DOI10.1016/j.ejor.2019.01.070zbMath1430.90052OpenAlexW2911515492MaRDI QIDQ1734353
Annelieke C. Baller, Daniele Vigo, Said Dabia, Wout E. H. Dullaert
Publication date: 27 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://research.vu.nl/en/publications/a648bb27-4452-49ab-abba-0ba83db36fda
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
A concise guide to existing and emerging vehicle routing problem variants, Complexity of inventory routing problems when routing is easy, Efficient methods for stochastic joint replenishment and delivery problem
Cites Work
- Unnamed Item
- On reformulations for the one-warehouse multi-retailer problem
- A distribution-free TSP tour length estimation model for random graphs
- A vendor managed inventory model under contractual storage agreement
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- Delivery strategies for blood products supplies
- Incorporating inventory and routing costs in strategic location models
- Efficient and effective heuristics for the coordinated capacitated lot-size problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- A polyhedral approach to edge coloring
- Operational estimators for the length of a traveling salesman tour
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Continuous approximation models in freight distribution management
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- A continuous model for production-distribution system design
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Industrial aspects and literature survey: Combined inventory management and routing
- A dynamic inventory model with supplier selection in a serial supply chain structure
- An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints
- A review of the joint replenishment problem literature: 1989--2005
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Bounds and Heuristics for Capacitated Routing Problems
- Cyclical schedules for the joint replenishment problem with dynamic demands
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Models to estimate average route lengths in different geographical environments
- Models and algorithms for the dynamic-demand joint replenishment problem
- Formulations for an inventory routing problem
- Selected Topics in Column Generation
- Effective heuristics for the dynamic demand joint replenishment problem
- More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’
- A Primer in Column Generation
