scientific article; zbMATH DE number 4119931

MaRDI QIDQ4733663zbMATH OpenFDO

Authors V. V. Kafarov, L. G. Koshelev, V. P. Meshalkin

Publication date 1989

zbMATH Keywords

heuristic decomposition methodhourly delivery schedulemultidimensional special transportation problemperishable product mix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
• An integrated production and distribution planning model for perishable products
• An Allocation and Distribution Model for Perishable Products
• A two-echelon inventory routing problem for perishable products
• Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network

Cited in

(5)

• Logistics network design for perishable products with heterogeneous quality decay
• Freshness-driven vehicle routing problem: modeling and application to the fresh agricultural product pick-storage-transportation
• An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India
• A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers
• Optimal transport to cold chain in perishable hand-picked agriculture

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733663)