Pages that link to "Item:Q4624897"
From MaRDI portal
The following pages link to Iterated local search and simulated annealing algorithms for the inventory routing problem (Q4624897):
Displaying 16 items.
- Inventory routing in a warehouse: the storage replenishment routing problem (Q2140300) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes (Q2669743) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Complexity of inventory routing problems when routing is easy (Q6068536) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
- A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers (Q6079875) (← 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)
- Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II (Q6090473) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)