Pages that link to "Item:Q337178"

The following pages link to Heuristics for dynamic and stochastic inventory-routing (Q337178):

Displaying 31 items.

• A variable neighborhood search for the multi-period collection of recyclable materials (Q320992) (← links)
• Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
• Parameter tuning for local-search-based matheuristic methods (Q680781) (← links)
• Heuristics for scheduling with inventory: Dynamic focus via constraint criticality (Q1347601) (← links)
• The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment (Q1651650) (← links)
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
• Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems (Q1734854) (← links)
• A hybrid heuristic for a stochastic production-inventory-routing problem (Q1742254) (← links)
• Inventory routing with pickups and deliveries (Q1754327) (← links)
• Economic model predictive inventory routing and control (Q1788929) (← links)
• Same-day delivery with pickup stations and autonomous vehicles (Q2003409) (← links)
• Cross docking for libraries with a depot (Q2029401) (← links)
• Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
• Spare parts inventory routing problem with transshipment and substitutions under stochastic demands (Q2240378) (← links)
• A maritime scheduling transportation-inventory problem with normally distributed demands and fully loaded/unloaded vessels (Q2294968) (← links)
• Waste collection inventory routing with non-stationary stochastic demands (Q2333149) (← links)
• Replenishment and denomination mix of automated teller machines with dynamic forecast demands (Q2337393) (← links)
• A mathematical programming-based heuristic for the production routing problem with transshipments (Q2664374) (← links)
• Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands (Q2668678) (← links)
• Probabilistic analyses and practical algorithms for inventory-routing models (Q2781136) (← links)
• Scenario tree-based heuristics for stochastic inventory-routing problems (Q2901065) (← links)
• Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
• (Q4343722) (← links)
• (Q4452966) (← links)
• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem (Q5356988) (← links)
• On the effect of using sensors and dynamic forecasts in inventory-routing problems (Q5883614) (← links)
• Long‐term effects of short planning horizons for inventory routing problems (Q6082197) (← links)
• Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
• Stochastic inventory routing with time-based shipment consolidation (Q6106772) (← links)
• Dynamic multi-period vehicle routing with touting (Q6113318) (← links)