A local search method for periodic inventory routing problem

Authors:
Lei Qin;Lixin Miao;Qingfang Ruan;Ying Zhang
Affiliations:
-;-;-;-
Venue:
Expert Systems with Applications: An International Journal
Year:
2014

Citing 12
Cited 0

A tabu search heuristic for the vehicle routing problem

Management Science
Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems

Management Science
A Periodic Inventory Routing Problem at a Supermarket Chain

Operations Research
An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity

Journal of Global Optimization
A simulation framework for real-time management and control of inventory routing decisions

Proceedings of the 38th conference on Winter simulation
Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times

Management Science
An integrated local search method for inventory and routing decisions

Expert Systems with Applications: An International Journal
The integrated production---inventory---distribution---routing problem

Journal of Scheduling
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing

Computers and Operations Research
A branch-and-price algorithm for an integrated production and inventory routing problem

Computers and Operations Research
A heuristic method for the inventory routing and pricing problem in a supply chain

Expert Systems with Applications: An International Journal
Coordination of split deliveries in one-warehouse multi-retailer distribution systems

Computers and Industrial Engineering

Quantified Score

Hi-index	12.05

Visualization

Abstract

Inventory routing problem considers inventory allocation and routing problems simultaneously, in which the replenishment policies and routing arrangement are determined by the supplier under the vendor managed inventory mode. What we consider here is a periodic inventory routing problem that once the delivery time, quantity and routing are determined, they will remain the same in the following periods. The problem is modeled concisely, and then it is decomposed into two subproblems, inventory problem and vehicle routing problem. The inventory problem is solved by proposing a local search method, which is achieved by four operators on delivery quantity and retailer's demand. Insertion operator aims to insert a new replenishment point of a retailer while removal operator is to remove a replenishment point. Besides, addition operator is adopted as an assistant tool, and crossover operator is proposed for some special cases. We also propose a tabu search method to solve the routing problem. Finally, the computational results show that the method is efficient and stable.