PL EN


2014 | 24 | 2 | 81-96
Article title

Solving IRPs using location based heuristics

Authors
Selected contents from this journal
Title variants
Languages of publication
EN
Abstracts
EN
Inventory routing problems (IRPs) occur where vendor managed inventory replenishment strategies are implemented in supply chains. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. The research presented in this paper aims at extending IRP formulation developed on the basis of location based heuristics proposed by Bramel and Simchi-Levi and continued by Hanczar. In the first phase of proposed algorithms, mixed integer programming is used to determine the partitioning of customers as well as dates and quantities of deliveries. Then, using 2-opt algorithm for solving the traveling sales-person problem the optimal routes for each partition are determined. In the main part of research the classical formulation is extended by additional constraints (visit spacing, vehicle filling rate, driver (vehicle) consistency, and heterogeneous fleet of vehicles) as well as the additional criteria are discussed. Then the impact of using each of proposed extensions for solution possibilities is evaluated. The results of computational tests are presented and discussed. Obtained results allow to conclude that the location based heuristics should be considered when solving real life instances of IRP.
Year
Volume
24
Issue
2
Pages
81-96
Physical description
Contributors
  • 1Faculty of Management, Information Systems and Finance, Wroclaw University of Economics, ul. Komandorska 118/120, 53-345 Wrocław
References
  • ANILY S., FEDERGRUEN A., One warehouse multiple retailer systems with vehicle routing costs, Management Science, 1990, 36, 92–114.
  • ANILY S., FEDERGRUEN A., Rejoinder to one warehouse multiple retailer systems with vehicle routing costs, Management Science, 1991, 37, 1497–1499.
  • ANILY S., FEDERGRUEN A., Two-echelon distribution systems with vehicle routing costs and central inventories, Operations Research, 1993, 41, 37–47.
  • ARCHETTI C., BERTAZZI L., LAPORTE G., SPERANZA M.G., A branch-and-cut algorithm for a vendor managed inventory routing problem, Transportation Science, 2007, 41, 382–391.
  • ARCHETTI C., BERTAZZI L., HERZ A., SPERANZA M.G., A hybrid heuristic for an inventory-routing problem, Informs Journal on Computing, 2012, 24, 101–116.
  • BARD J., HUANG L., JAILLET P., DROR M., A decomposition approach to the inventory routing problem with satellite facilities, Transportation Science, 1998, 32, 189–203.
  • BELL W., DALBERTO L., FISHER M.L., GREENFIELD A., JAIKUMAR R., KEDIA P., MACK R., PRUTZMAN P., Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces, 1983, 13 (6), 4–23.
  • BELTRAMI E.J., BODIN L.D., Networks and vehicle routing for municipal waste collection, Networks, 1974, 4, 65–94.
  • BERTAZZI L., PALETTA G., SPERANZA M.G., Deterministic order-up-to level policies in an inventory routing problem, Transportation Science, 2002, 36, 119–132.
  • BERTAZZI L., SAVELSBERGH M., SPERANZA M.G., Inventory routing, [in:] B. Golden, S. Raghavan, E. Wasil (Eds.), The vehicle routing problem. Latest advances and new challenges, Springer, 2007, 49–73.
  • BRAMEL J., SIMCHI-LEVI D., A location based heuristic for general routing problems, Operations Research, 1995, 43, 649–660.
  • BURNS L.D., HALL R.W., BLUMENFELD D.E., DAGANZO C.F., Distribution strategies that minimize transportation and inventory costs, Operations Research, 1985, 33, 469–490.
  • CAMPBELL A.M., SAVELSBERGH M.W.P., A decomposition approach for the inventory-routing problem, Transportation Science, 2004, 38, 408–502.
  • CHAN L.M., FEDERGRUEN A., SIMCHI-LEVI D., Probabilistic analyses and practical algorithms for inventory-routing models, Operations Research, 1998, 46, 96–106.
  • COELHO L.C., CORDEAU J.F., LAPORT G., Consistency in multi-vehicle inventory-routing, Transportation Research, Part C, 2012, 24, 270–287.
  • DESROCHERS M., LAPORTE G., Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints, Operations Research Letters, 1991, 10, 27–36.
  • DROR M., BALL M.O., GOLDEN B.L., A computational comparison of algorithms for the inventory routing problem, Annals of Operations Research, 1985, 4, 3–23.
  • DROR M., BALL M.O., Inventory/routing. Reduction from an annual to a short period problem, Naval Research Logistics Quarterly, 1987, 34, 891–905.
  • DROR M., TRUDEAU P., Stochastic inventory routing. Stockout and route failure, Transportation Science, 1992, 26, 172–184.
  • FISHER M.L., GREENFIELD A., JAIKUMAR R., KEDIA P., Real-time scheduling of a bulk delivery fleet. Practical application of Lagrangean relaxation, Technical report, The Wharton School, University of Pennsylvania, 1982.
  • GALLEGO G., SIMCHI-LEVI D., On the effectiveness of direct shipping strategy for the one warehouse multi-retailer r-systems, Management Science, 1990, 36, 240–243.
  • GAUR V., FISHER M.L., A periodic inventory routing problem at a supermarket chain, Operations Research, 2004, 52, 813–822.
  • GOLDEN B., ASSAD A., DAHL R., Analysis of a large scale vehicle routing problem with an inventory component, Large Scale Systems, 1984, 7, 181–190.
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.desklight-f826a223-c0ed-4952-b7c3-9540c9b64030
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.