Pith. sign in

REVIEW 1 cited by

Optimizing Inventory Routing: A Decision-Focused Learning Approach using Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.00983 v1 pith:VQPV76BR submitted 2023-11-02 cs.LG cs.AIcs.SYeess.SYmath.OCstat.ML

classification cs.LGcs.AIcs.SYeess.SYmath.OCstat.ML
keywords inventoryapproachroutinglearningoptimizationchaindecision-focuseddemand
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Inventory Routing Problem (IRP) is a crucial challenge in supply chain management as it involves optimizing efficient route selection while considering the uncertainty of inventory demand planning. To solve IRPs, usually a two-stage approach is employed, where demand is predicted using machine learning techniques first, and then an optimization algorithm is used to minimize routing costs. Our experiment shows machine learning models fall short of achieving perfect accuracy because inventory levels are influenced by the dynamic business environment, which, in turn, affects the optimization problem in the next stage, resulting in sub-optimal decisions. In this paper, we formulate and propose a decision-focused learning-based approach to solving real-world IRPs. This approach directly integrates inventory prediction and routing optimization within an end-to-end system potentially ensuring a robust supply chain strategy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Pessimistic bilevel optimization approach for decision-focused learning

    math.OC 2025-01 conditional novelty 6.0 of 10

    A branch-and-cut method minimizes the pessimistic IEO regret loss directly for 0-1 combinatorial decision-focused learning, avoiding the need for a convex hull.

Pith tools