Pages that link to "Item:Q2815432"
From MaRDI portal
The following pages link to A Hybrid Heuristic for an Inventory Routing Problem (Q2815432):
Displayed 50 items.
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- A multi-phase heuristic for the production routing problem (Q1652406) (← links)
- A two-phase solution algorithm for the flexible periodic vehicle routing problem (Q1654343) (← links)
- The dynamic bowser routing problem (Q1711454) (← links)
- Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (Q1720647) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- Economic model predictive inventory routing and control (Q1788929) (← links)
- Exact solution methods for the multi-period vehicle routing problem with due dates (Q2002858) (← links)
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- A matheuristic solution approach for the production routing problem with visit spacing policy (Q2312350) (← links)
- Discrete time and continuous time formulations for a short sea inventory routing problem (Q2358148) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- An inventory-routing problem with the objective of travel time minimization (Q2514745) (← 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)
- An iterative matheuristic for the inventory routing problem (Q2668692) (← links)
- An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
- A matheuristic for solving inventory sharing problems (Q2669710) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system (Q2798528) (← links)
- The inventory routing problem: the value of integration (Q2811934) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation (Q2980176) (← links)
- A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
- Formulations for an inventory routing problem (Q4979996) (← links)
- Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem (Q5356988) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- The consistent production routing problem (Q6064169) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands (Q6088245) (← links)
- Adaptive evolutionary algorithms for portfolio selection problems (Q6088765) (← links)
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands (Q6090498) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- A multi-period inventory routing problem with procurement decisions: a case in China (Q6170693) (← links)