A Combined Vehicle Routing and Inventory Allocation Problem

@article{Federgruen1984ACV,
  title={A Combined Vehicle Routing and Inventory Allocation Problem},
  author={Awi Federgruen and Paul H. Zipkin},
  journal={Oper. Res.},
  year={1984},
  volume={32},
  pages={1019-1037}
}
We address the combined problem of allocating a scarce resource among several locations, and planning deliveries using a fleet of vehicles. Demands are random, and holding and shortage costs must be considered in the decision along with transportation costs. We show how to extend some of the available methods for the deterministic vehicle routing problem to this case. Computational results using one such adaptation show that the algorithm is fast enough for practical work, and that substantial… 

Figures and Tables from this paper

Heuristic approaches for the inventory-routing problem with backlogging

A Lagrangian heuristic approach for the Inventory Routing Problem

The inventory routing problem (IRP) deals with the coordination of inventory replenishment and transportation. The IRP refers to the situation where the inventory replenishment at a number of

A hybrid heuristic for inventory routing problem

In the proposed heuristic, inventory is allocated using an ILP, vehicles are allotted to customers on the basis of proximity and routes for vehicles are determined using simulated annealing.

A CONSTRUCTIVE HEURISTIC FOR THE INTEGRATED INVENTORY-DISTRIBUTION PROBLEM

We study the integrated inventory distribution problem which is concerned with multiperiod inventory holding, backlogging, and vehicle routing decisions for a set of customers who receive units of a

A SHIP Inventory Routing Problem with Heterogeneous Vehicles under Order-Up-To Level Policies

This paper studies a variant of Inventory Routing Problem (IRP) in the context of Supply Hub in Industrial Park (SHIP), where a cluster of closely located manufacturers share the warehousing and

Heuristic approach for the integrated inventory-distribution problem

  • Business
We study the integrated inventory distribution problem. We consider an environment in which the demand of each customer is relatively small compared to the vehicle capacity, and the customers are

Algorithm for the Inventory-Routing Problem Based on R-System

The inventory-routing problem is an important approach for the enterprises to save energy and improve efficiency. The improvement of the utilization rate of vehicles and the reduction of the

INTEGRATING THE INVENTORY MANAGEMENT AND VEHICLE ROUTING PROBLEMS FOR CONGESTED URBAN LOGISTICS NETWORK

A new class of strategies for giving the optimal inventory replenishments for each retailer while the efficient delivery design is taken into account such that the minimization of total inventory cost and transportation cost is achieved.

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

The inventory routing problem considered in this paper is concerned with the repeated distribution of a commodity, such as heating oil, over a long period of time to a large number of customers. The

Inventory-Routing Model, for a Multi-Period Problem with Stochastic and Deterministic Demand

The need for integration in the supply chain management leads us to consider the coordination of two logistic planning functions: transportation and inventory. The coordination of these activities
...

References

SHOWING 1-10 OF 26 REFERENCES

A Framework For Probabilistic Vehicle Routing

This paper investigates solution procedures for the case where other appropriate probability distributions are assumed and develops an efficient heuristic solution procedure which was quite effective in generating an excellent set of fixed vehicle routes.

Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points

A new algorithm is presented that allows routes from several depots to be constructed simultaneously, subject to restrictions on numbers of vehicles at individual depots, and a flexible priority rule will select those to be served.

The Multiple Terminal Delivery Problem with Probabilistic Demands

A heuristic approach is presented for solving the multiterminal delivery problem with constraints on the system and probabilistic demands and results in “near optimal” solutions to a difficult problem.

A SIMULATION AND STATISTICAL ANALYSIS OF STOCHASTIC VEHICLE ROUTING WITH TIMING CONSTRAINTS

This paper examines a generalization of the vehicle-dispatch problem in which time constraints as well as stochastic demand and travel times are considered, and an effective heuristic is tested on single-estimate travel times.

Formulation and structure of more complex/realistic routing and scheduling problems

This work classifies the features that seem to be encountered in real vehicle routing problems and indicates which features cause the greatest difficulty and which modeling approaches allow to represent the greatest range of practical considerations or features.

Multicommodity Distribution System Design by Benders Decomposition

A commonly occurring problem in distribution system design is the optimal location of intermediate distribution facilities between plants and customers. A multi-commodity capacitated single-period

Integer programming approaches to the travelling salesman problem

The generality of the method and the modest solution times achieved leads the author to believe that such an LP approach to other combinatorial problems deserves further consideration.

Solution techniques for some allocation problems

This paper presents methods for solving allocation problems that can be stated as convex knapsack problems with generalized upper bounds and introduces an approximation method to solve certain equations, which arise during the procedures.