Skip to main content
Erschienen in: 4OR 2/2018

16.11.2017 | Research Paper

The inventory replenishment planning and staggering problem: a bi-objective approach

verfasst von: Fayez F. Boctor, Marie-Claude Bolduc

Erschienen in: 4OR | Ausgabe 2/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

To the best of our knowledge, this paper is the first one to suggest formulating the inventory replenishment problem as a bi-objective decision problem where, in addition to minimizing the sum of order and inventory holding costs, we should minimize the required storage space. Also, it develops two solution methods, called the exploratory method (EM) and the two-population evolutionary algorithm (TPEA), to solve the problem. The proposed methods generate a near-Pareto front of solutions with respect to the considered objectives. As the inventory replenishment problem have never been formulated as a bi-objective problem and as the literature does not provide any method to solve the considered bi-objective problem, we compared the results of the EM to three versions of the TPEA. The results obtained suggest that although the TPEA produces good near-Pareto solutions, the decision maker can apply a combination of both methods and choose among all the obtained solutions.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Anily S (1991) Multi-item replenishment and storage problem (MIRSP): heuristics and bounds. Oper Res 39:233–243CrossRef Anily S (1991) Multi-item replenishment and storage problem (MIRSP): heuristics and bounds. Oper Res 39:233–243CrossRef
Zurück zum Zitat Boctor FF (1985) Single machine lot scheduling: a comparison of some solution procedures. RA IRO Autom Prod Inf Ind 19:389–402 Boctor FF (1985) Single machine lot scheduling: a comparison of some solution procedures. RA IRO Autom Prod Inf Ind 19:389–402
Zurück zum Zitat Boctor FF (1987) The G-group heuristic for single machine lot scheduling. Int J Prod Res 25:363–379CrossRef Boctor FF (1987) The G-group heuristic for single machine lot scheduling. Int J Prod Res 25:363–379CrossRef
Zurück zum Zitat Boctor FF (2010) Offsetting inventory replenishment cycles to minimize storage space. Eur J Oper Res 203:321–325CrossRef Boctor FF (2010) Offsetting inventory replenishment cycles to minimize storage space. Eur J Oper Res 203:321–325CrossRef
Zurück zum Zitat Boctor FF, Laporte G, Renaud J (2004) Models and algorithms for the dynamic demand joint replenishment problem. Int J Prod Res 42:2667–2678CrossRef Boctor FF, Laporte G, Renaud J (2004) Models and algorithms for the dynamic demand joint replenishment problem. Int J Prod Res 42:2667–2678CrossRef
Zurück zum Zitat Buschkühl L, Sahling F, Helber S, Templemeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum 32:231–261CrossRef Buschkühl L, Sahling F, Helber S, Templemeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum 32:231–261CrossRef
Zurück zum Zitat Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRef Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRef
Zurück zum Zitat El-Najdawi M, Kleindorfer PR (1993) Common cycle lot-size scheduling for multi-product, multi-stage production. Manag Sci 39:872–885CrossRef El-Najdawi M, Kleindorfer PR (1993) Common cycle lot-size scheduling for multi-product, multi-stage production. Manag Sci 39:872–885CrossRef
Zurück zum Zitat Gallego G, Shaw D, Simchi-Levi D (1992) The complexity of the staggering problem and other classical inventory problems. Oper Res Lett 12:47–52CrossRef Gallego G, Shaw D, Simchi-Levi D (1992) The complexity of the staggering problem and other classical inventory problems. Oper Res Lett 12:47–52CrossRef
Zurück zum Zitat Gallego G, Queyranne M, Simchi-Levi D (1996) Single resource multi-item inventory systems. Oper Res 44:580–595CrossRef Gallego G, Queyranne M, Simchi-Levi D (1996) Single resource multi-item inventory systems. Oper Res 44:580–595CrossRef
Zurück zum Zitat Goyal SK (1978) A note on multi-production inventory situation with one restriction. J Oper Res Soc 29:269–271 Goyal SK (1978) A note on multi-production inventory situation with one restriction. J Oper Res Soc 29:269–271
Zurück zum Zitat Hall NG (1988) A comparison of inventory replenishment heuristics for minimizing maximum storage. Am J Math Manag Sci 18:245–258 Hall NG (1988) A comparison of inventory replenishment heuristics for minimizing maximum storage. Am J Math Manag Sci 18:245–258
Zurück zum Zitat Hariga MA, Jackson PL (1996) The warehouse scheduling problem: formulation and algorithm. IIE Trans 28:115–127CrossRef Hariga MA, Jackson PL (1996) The warehouse scheduling problem: formulation and algorithm. IIE Trans 28:115–127CrossRef
Zurück zum Zitat Harris FW (1913) How many parts to make at once. Oper Res 38:947–950 (reprint from Fact Mag Manag 10, 135–36, 152) Harris FW (1913) How many parts to make at once. Oper Res 38:947–950 (reprint from Fact Mag Manag 10, 135–36, 152)
Zurück zum Zitat Hartley R, Thomas LC (1982) The deterministic, two-product, inventory with capacity constraint. J Oper Res Soc 33:1013–1020CrossRef Hartley R, Thomas LC (1982) The deterministic, two-product, inventory with capacity constraint. J Oper Res Soc 33:1013–1020CrossRef
Zurück zum Zitat Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365–378CrossRef Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365–378CrossRef
Zurück zum Zitat Kasprzak E, Lewis K (2001) Pareto analysis in multi-objective optimization using the colinearity theorem and scaling method. Struct Multidiscip Optim 22:208–218CrossRef Kasprzak E, Lewis K (2001) Pareto analysis in multi-objective optimization using the colinearity theorem and scaling method. Struct Multidiscip Optim 22:208–218CrossRef
Zurück zum Zitat Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989–2005. Eur J Oper Res 186:1–16CrossRef Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989–2005. Eur J Oper Res 186:1–16CrossRef
Zurück zum Zitat Konak A, Coit DW, Smith AE (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992–1007CrossRef Konak A, Coit DW, Smith AE (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992–1007CrossRef
Zurück zum Zitat Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369–395CrossRef Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369–395CrossRef
Zurück zum Zitat Moon IK, Cha BC, Kim SK (2008) Offsetting inventory cycles using mixed integer programming and genetic algorithm. Int J Ind Eng 15:245–256 Moon IK, Cha BC, Kim SK (2008) Offsetting inventory cycles using mixed integer programming and genetic algorithm. Int J Ind Eng 15:245–256
Zurück zum Zitat Murthy NN, Benton WC, Rubin PA (2003) Offsetting inventory cycles of items sharing storage. Eur J Oper Res 150:304–319CrossRef Murthy NN, Benton WC, Rubin PA (2003) Offsetting inventory cycles of items sharing storage. Eur J Oper Res 150:304–319CrossRef
Zurück zum Zitat Ouenniche J, Boctor FF (1998) Sequencing, lot sizing and scheduling of several products in job shops: the common cycle approach. Int J Prod Res 36:1125–1140CrossRef Ouenniche J, Boctor FF (1998) Sequencing, lot sizing and scheduling of several products in job shops: the common cycle approach. Int J Prod Res 36:1125–1140CrossRef
Zurück zum Zitat Ouenniche J, Boctor FF (2001) The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops. Int J Prod Res 39:81–98CrossRef Ouenniche J, Boctor FF (2001) The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops. Int J Prod Res 39:81–98CrossRef
Zurück zum Zitat Page E, Paul RJ (1976) Multi-production inventory situation with one restriction. J Oper Res Soc 27:815–834CrossRef Page E, Paul RJ (1976) Multi-production inventory situation with one restriction. J Oper Res Soc 27:815–834CrossRef
Zurück zum Zitat Robinson P, Narayananb A, Sahin F (2009) Coordinated deterministic dynamic demand lot-sizing problem: a review of models and algorithms. Omega 37:3–15CrossRef Robinson P, Narayananb A, Sahin F (2009) Coordinated deterministic dynamic demand lot-sizing problem: a review of models and algorithms. Omega 37:3–15CrossRef
Zurück zum Zitat Rosenblatt MJ, Rothblum UG (1990) On the single resource capacity problem for multi-item inventory systems. Oper Res 38:686–693CrossRef Rosenblatt MJ, Rothblum UG (1990) On the single resource capacity problem for multi-item inventory systems. Oper Res 38:686–693CrossRef
Zurück zum Zitat Silver E, Pyke D, Peterson R (1998) Inventory management and production planning and scheduling, 3rd edn. Wiley, London Silver E, Pyke D, Peterson R (1998) Inventory management and production planning and scheduling, 3rd edn. Wiley, London
Zurück zum Zitat Thomas LC, Hartley R (1983) An algorithm for the limited capacity inventory problem with staggering. J Oper Res Soc 34:81–85CrossRef Thomas LC, Hartley R (1983) An algorithm for the limited capacity inventory problem with staggering. J Oper Res Soc 34:81–85CrossRef
Zurück zum Zitat Van Veldhuizen DA, Lamont GB (2000) Multi-objective evolutionary algorithms: analyzing the state of the art. Evol Comput 8:125–147CrossRef Van Veldhuizen DA, Lamont GB (2000) Multi-objective evolutionary algorithms: analyzing the state of the art. Evol Comput 8:125–147CrossRef
Zurück zum Zitat Wagner HM, Whitin TM (1958) Dynamic version of economic lot size model. Manag Sci 5:89–96CrossRef Wagner HM, Whitin TM (1958) Dynamic version of economic lot size model. Manag Sci 5:89–96CrossRef
Zurück zum Zitat Yao MJ, Chu WM (2008) A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements. Omega 36:619–631CrossRef Yao MJ, Chu WM (2008) A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements. Omega 36:619–631CrossRef
Zurück zum Zitat Zitzler E, Deb K, Thiele L (2000) Comparison of multi objective evolutionary algorithms: empirical results. Evolut Comput 8:173–195CrossRef Zitzler E, Deb K, Thiele L (2000) Comparison of multi objective evolutionary algorithms: empirical results. Evolut Comput 8:173–195CrossRef
Zurück zum Zitat Zitzler E, Laumanns M, Thiele L (2001) SPEA 2: improving the strength Pareto evolutionary algorithm, TIK report 103. Swiss Federal Institute of Technology, Zurich Zitzler E, Laumanns M, Thiele L (2001) SPEA 2: improving the strength Pareto evolutionary algorithm, TIK report 103. Swiss Federal Institute of Technology, Zurich
Zurück zum Zitat Zoller K (1977) Deterministic multi-item inventory systems with limited capacity. Manag Sci 24:451–455CrossRef Zoller K (1977) Deterministic multi-item inventory systems with limited capacity. Manag Sci 24:451–455CrossRef
Metadaten
Titel
The inventory replenishment planning and staggering problem: a bi-objective approach
verfasst von
Fayez F. Boctor
Marie-Claude Bolduc
Publikationsdatum
16.11.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
4OR / Ausgabe 2/2018
Print ISSN: 1619-4500
Elektronische ISSN: 1614-2411
DOI
https://doi.org/10.1007/s10288-017-0362-2

Weitere Artikel der Ausgabe 2/2018

4OR 2/2018 Zur Ausgabe

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.