A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing

From MaRDI portal
Publication:1820686

DOI10.1016/0305-0548(86)90062-6zbMath0614.90061OpenAlexW2062188707MaRDI QIDQ1820686

Moshe Dror, Laurence S. Levy

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90062-6



Related Items

An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem, Heuristics for unequal weight delivery problems with a fixed error guarantee, A partition approach to the inventory/routing problem, Inventory routing with continuous moves, Routing problems: A bibliography, A tabu search heuristic for the multi-depot vehicle routing problem, Period and phase of customer replenishment: A new approach to the strategic inventory/routing problem, Hybridizations of evolutionary algorithms with large neighborhood search, A data‐driven optimization approach to plan smart waste collection operations, The Split Delivery Vehicle Routing Problem: A Survey, Comparing descent heuristics and metaheuristics for the vehicle routing problem, A survey of very large-scale neighborhood search techniques, Split delivery routing, Industrial aspects and literature survey: Combined inventory management and routing, A new heuristic for the fleet size and mix vehicle routing problem, Factory gate pricing: an analysis of the Dutch retail distribution, Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure, Cash flow optimization in delivery scheduling, Direct shipping and the dynamic single-depot/multi-retailer inventory system, Heuristic methods and applications: A categorized survey, Modeling inventory routing problems in supply chains of high consumption products



Cites Work