A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands (Q6090498): Difference between revisions

Latest revision as of 18:21, 30 December 2024

scientific article; zbMATH DE number 7767655

Language	Label	Description	Also known as
English	A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands	scientific article; zbMATH DE number 7767655

Statements

instance of

scholarly article

0 references

title

A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands (English)

0 references

author

Q6090497

0 references

Alejandro Estrada-Moreno

0 references

Javier Panadero

0 references

Angel A. Juan

0 references

published in

International Transactions in Operational Research

0 references

publication date

17 November 2023

0 references

zbMATH Keywords

multi-period inventory routing problem

0 references

stochastic demands

0 references

online data

0 references

biased randomization

0 references

simheuristics

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/itor.12776

0 references

cites work

An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem

0 references

Industrial aspects and literature survey: Combined inventory management and routing

0 references

Q3523239

0 references

A Hybrid Heuristic for an Inventory Routing Problem

0 references

Dynamic pickup and delivery problems

0 references

A two-phase algorithm for the cyclic inventory routing problem

0 references

Inventory management with log-normal demand per unit time

0 references

A decomposition-based heuristic for the multiple-product inventory-routing problem

0 references

A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls

0 references

A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains

0 references

Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility

0 references

The ALGACEA‐1 method for the capacitated vehicle routing problem

0 references

Feature Article: Optimization for simulation: Theory vs. Practice

0 references

A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands

0 references

Using scenario trees and progressive hedging for stochastic inventory routing problems

0 references

Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework

0 references

Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands

0 references

An inventory-routing problem with the objective of travel time minimization

0 references

A multi-agent based cooperative approach to scheduling and routing

0 references

A two phase variable neighborhood search for the multi-product inventory routing problem

0 references

Route and fleet design for cyclic inventory routing

0 references

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times

0 references

Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem

0 references

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

0 references

Large scale stochastic inventory routing problems with~split delivery and service level constraints

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6090498

@@ Property / DOI @@
-.1111/itor.12776
@@ Property / DOI: 10.1111/itor.12776 / rank @@
-Normal rank
@@ Property / DOI @@
+.1111/ITOR.12776
@@ Property / DOI: 10.1111/ITOR.12776 / rank @@
+Normal rank