An evolutionary approach for the offsetting inventory cycle problem

References

• Aksoy, Y., & Selcuk Erenguc, S. (1988). Multi‐item inventory models with co‐ordinated replenishments: A survey. International Journal of Operations & Production Management, 8, 63–73.10.1108/eb054814
   Google Scholar
• Amaya, C. A., Carvajal, J., & Castaño, F. (2013). A heuristic framework based on linear programming to solve the constrained joint replenishment problem (C-JRP). International Journal of Production Economics, 144, 243–247.10.1016/j.ijpe.2013.02.008
   Web of Science ®Google Scholar
• Arkin, E., Joneja, D., & Roundy, R. (1989). Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8, 61–66.10.1016/0167-6377(89)90001-1
   Web of Science ®Google Scholar
• Aytug, H., Khouja, M., & Vergara, F. E. (2003). Use of genetic algorithms to solve production and operations management problems: A review. International Journal of Production Research, 41, 3955–4009.10.1080/00207540310001626319
   Web of Science ®Google Scholar
• Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G., & Stewart, W. R., Jr. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1, 9–32.10.1007/BF02430363
   Google Scholar
• Blickle, T., & Thiele, L. (1995). A comparison of selection schemes used in genetic algorithms. Technical Report 11, Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich.
   Google Scholar
• Boctor, F. F. (2010). Offsetting inventory replenishment cycles to minimize storage space. European Journal of Operational Research, 203, 321–325.10.1016/j.ejor.2009.07.035
   Web of Science ®Google Scholar
• Boctor, F. F., & Bolduc, M. C. (2012). The inventory replenishment planning and staggering problem revisited. Montreal: CIRRELT.
   Google Scholar
• Boctor, F. F., & Bolduc, M. C. (2015). Inventory replenishment planning and staggering. IFAC-PapersOnLine, 48, 1416–1421.10.1016/j.ifacol.2015.06.285
   Google Scholar
• Cha, B. C., Moon, I. K., & Park, J. H. (2008). The joint replenishment and delivery scheduling of the one-warehouse, n-retailer system. Transportation Research Part E: Logistics and Transportation Review, 44, 720–730.10.1016/j.tre.2007.05.010
   Web of Science ®Google Scholar
• Chiu, C. Y., Lin, Y., Sheu, D. F., & Ho, W. T. (2014). Common replenishment cycle with mixed batch shipment policy for a single-vendor multi-buyer integrated system. European Journal of Industrial Engineering, 8, 168–192.10.1504/EJIE.2014.060435
   Web of Science ®Google Scholar
• Croot, E., & Huang, K. (2013). A class of random algorithms for inventory cycle offsetting. International Journal of Operational Research, 18, 201–217.10.1504/IJOR.2013.056115
   Google Scholar
• Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186, 311–338.10.1016/S0045-7825(99)00389-8
   Web of Science ®Google Scholar
• Deep, K., Singh, K. P., Kansal, M. L., & Mohan, C. (2009). A real coded genetic algorithm for solving integer and mixed integer optimization problems. Applied Mathematics and Computation, 212, 505–518.10.1016/j.amc.2009.02.044
   Web of Science ®Google Scholar
• Deep, K., & Thakur, M. (2007a). A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation, 188, 895–911.10.1016/j.amc.2006.10.047
   Web of Science ®Google Scholar
• Deep, K., & Thakur, M. (2007b). A new mutation operator for real coded genetic algorithms. Applied Mathematics and Computation, 193, 211–230.10.1016/j.amc.2007.03.046
   Web of Science ®Google Scholar
• Dowsland, K. A. (1996). Genetic algorithms-a tool for OR? Journal of the Operational Research Society, 47, 550–561.10.1057/jors.1996.60
   Web of Science ®Google Scholar
• Franciosi, C., Miranda, S., Iannone, R., & Lambiase, A. (2015, September 21–23). A heuristics with simulative approach for the determination of the optimal offsetting replenishment cycles to reduce the warehouse space. In The 14th International Conference on Modeling and Applied Simulation, MAS 2015 (pp. 17–25), Bergeggi.
   Google Scholar
• Gallego, G., Shaw, D., & Simchi-Levi, D. (1992). The complexity of the staggering problem, and other classical inventory problems. Operations Research Letters, 12, 47–52.10.1016/0167-6377(92)90021-T
   Web of Science ®Google Scholar
• Goldberg, D. E., & Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. Foundations of genetic algorithms, 1, 69–93.
   Google Scholar
• Goyal, S. K. (1973). Determination of economic packaging frequency for items jointly replenished. Management Science, 20, 232–235.10.1287/mnsc.20.2.232
   Web of Science ®Google Scholar
• Goyal, S. K., & Satir, A. T. (1989). Joint replenishment inventory control: Deterministic and stochastic models. European Journal of Operational Research, 38, 2–13.10.1016/0377-2217(89)90463-3
   Web of Science ®Google Scholar
• Hadley, G., & Whitin, T. M. (1963). Analysis of inventory systems. Englewood Cliffs, NJ: Prentice Hall.
   Google Scholar
• Haji, R., & Mansuri, M. (1995). Optimum common cycle for scheduling a single-machine multiproduct system with a budgetary constraint. Production Planning & Control, 6, 151–156.10.1080/09537289508930264
   Web of Science ®Google Scholar
• Haksever, C., & Moussourakis, J. (2005). A model for optimizing multi-product inventory systems with multiple constraints. International Journal of Production Economics, 97, 18–30.10.1016/j.ijpe.2004.05.004
   Web of Science ®Google Scholar
• Hall, N. G. (1998). A comparison of inventory replenishment heuristics for minimizing maximum storage. American Journal of Mathematical and Management Sciences, 18, 245–258.10.1080/01966324.1998.10737465
   Google Scholar
• Holland, J. H. (1975). Adaption in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press.
   Google Scholar
• Hoque, M. A. (2006). An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints. European Journal of Operational Research, 175, 1033–1042.10.1016/j.ejor.2005.06.022
   Web of Science ®Google Scholar
• Hua, Z., & Huang, F. (2006). An effective genetic algorithm approach to large scale mixed integer programming problems. Applied Mathematics and Computation, 174, 897–909.10.1016/j.amc.2005.05.017
   Web of Science ®Google Scholar
• Johnson, L. A., & Montgomery, D. C. (1974). Operations research in production planning, scheduling, and inventory control (Vol. 6). New York, NY: Wiley.
   Google Scholar
• Kaspi, M., & Rosenblatt, M. J. (1983). An improvement of Silver’s algorithm for the joint replenishment problem. AIIE Transactions, 15, 264–267.
   Web of Science ®Google Scholar
• Kaspi, M., & Rosenblatt, M. J. (1991). On the economic ordering quantity for jointly replenished items. International Journal of Production Research, 29, 107–114.10.1080/00207549108930051
   Web of Science ®Google Scholar
• Khouja, M., & Goyal, S. (2008). A review of the joint replenishment problem literature: 1989–2005. European Journal of Operational Research, 186(1), 1–16.10.1016/j.ejor.2007.03.007
   Web of Science ®Google Scholar
• Khouja, M., Michalewicz, Z., & Satoskar, S. S. (2000). A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem. Production Planning & Control, 11, 556–564.10.1080/095372800414115
   Web of Science ®Google Scholar
• Lee, F. C., & Yao, M. J. (2003). A global optimum search algorithm for the joint replenishment problem under power-of-two policy. Computers & Operations Research, 30, 1319–1333.10.1016/S0305-0548(02)00073-4
   Web of Science ®Google Scholar
• Li, Y. X., & Gen, M. (1996). Nonlinear mixed integer programming problems using genetic algorithm and penalty function. IEEE International Conference on Systems, Man, and Cybernetics, 4, 2677–2682.
   Google Scholar
• Maiti, A. K., Bhunia, A. K., & Maiti, M. (2006). An application of real-coded genetic algorithm (RCGA) for mixed integer non-linear programming in two-storage multi-item inventory model with discount policy. Applied Mathematics and Computation, 183, 903–915.10.1016/j.amc.2006.05.141
   Web of Science ®Google Scholar
• Miller, B. L., & Goldberg, D. E. (1995). Genetic algorithms, tournament selection, and the effects of noise. Complex Systems, 9, 193–212.
   Google Scholar
• Miranda, S., Fera, M., Iannone, R., & Riemma, S. (2015). A multi-item constrained EOQ calculation algorithm with exit condition: A comparative analysis. IFAC-PapersOnLine, 48, 1314–1319.10.1016/j.ifacol.2015.06.267
   Google Scholar
• Mitchell, M. (1998). An introduction to genetic algorithms. Cambridge, MA: MIT press.
   Google Scholar
• Moon, I. K., & Cha, B. C. (2006). The joint replenishment problem with resource restriction. European Journal of Operational Research, 173, 190–198.10.1016/j.ejor.2004.11.020
   Web of Science ®Google Scholar
• Moon, I. K., Cha, B. C., & Kim, S. K. (2008). Offsetting inventory cycles using mixed integer programming and genetic algorithm. International Journal of Industrial Engineering: Theory, Applications and Practice, 15, 245–256.
   Web of Science ®Google Scholar
• Murthy, N. N., Benton, W. C., & Rubin, P. A. (2003). Offsetting inventory cycles of items sharing storage. European Journal of Operational Research, 150, 304–319.10.1016/S0377-2217(02)00518-0
   Web of Science ®Google Scholar
• Rosenblatt, M. J., & Rothblum, U. G. (1990). On the single resource capacity problem for multi-item inventory systems. Operations Research, 38, 686–693.10.1287/opre.38.4.686
   Web of Science ®Google Scholar
• Russell, R. A., & Urban, T. L. (2016). Offsetting inventory replenishment cycles. European Journal of Operational Research, 254, 105–112.10.1016/j.ejor.2016.03.055
   Web of Science ®Google Scholar
• Silver, E. A. (1976). A simple method of determining order quantities in joint replenishments under deterministic demand. Management Science, 22, 1351–1361.10.1287/mnsc.22.12.1351
   Web of Science ®Google Scholar
• Teo, C. P., Ou, J., & Tan, K. C. (1998). Multi-item inventory staggering problems: Heuristics and bounds. In Proceedings of the Ninth Annual Ace-Siam Symposium on Discrete Algorithms, By Association for Computing Machiner. San Francisco, CA.
   Google Scholar
• Tersine, R. J. (1976). Materials management and inventory systems. Amsterdam: North Holland.
   Google Scholar
• Thomas, L. C., & Hartley, R. (1983). An algorithm for limited capacity inventory problem with staggering. Journal of the Operational Research Society, 34, 81–85.10.1057/jors.1983.10
   Web of Science ®Google Scholar
• Tsai, C. Y., Tsai, C. Y., & Huang, P. W. (2009). An association clustering algorithm for can-order policies in the joint replenishment problem. International Journal of Production Economics, 117, 30–41.10.1016/j.ijpe.2008.08.056
   Web of Science ®Google Scholar
• Van Eijs, M. J. G. (1993). A note on the joint replenishment problem under constant demand. Journal of the Operational Research Society, 44, 185–191.10.1057/jors.1993.31
   Web of Science ®Google Scholar
• Viswanathan, S. (1996). A new optimal algorithm for the joint replenishment problem. Journal of the Operational Research Society, 47, 936–944.10.1057/jors.1996.119
   Web of Science ®Google Scholar
• Wang, L., He, J., Wu, D., & Zeng, Y. R. (2012). A novel differential evolution algorithm for joint replenishment problem under interdependence and its application. International Journal of Production Economics, 135, 190–198.10.1016/j.ijpe.2011.06.015
   Web of Science ®Google Scholar
• Wildeman, R. E., Frenk, J. B. G., & Dekker, R. (1997). An efficient optimal solution method for the joint replenishment problem. European Journal of Operational Research, 99, 433–444.10.1016/S0377-2217(96)00072-0
   Web of Science ®Google Scholar
• Yao, M. J. (2007). Solving the joint replenishment problem with warehouse-space restrictions using a genetic algorithm. Journal of the Chinese Institute of Industrial Engineers, 24, 128–141.10.1080/10170660709509028
   Google Scholar
• Yao, M. J., & Chu, W. M. (2008). A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements. Omega, 36, 619–631.10.1016/j.omega.2007.01.007
   Web of Science ®Google Scholar
• Yao, M. J., Chu, W. M., & Lin, Y. F. (2008). Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule. Computers & Operations Research, 35, 3230–3242.10.1016/j.cor.2007.02.020
   Web of Science ®Google Scholar
• Yokota, T., Gen, M., Li, Y., & Kim, C. E. (1996). A genetic algorithm for interval nonlinear integer programming problem. Computers & Industrial Engineering, 31, 913–917.10.1016/S0360-8352(96)00263-X
   Web of Science ®Google Scholar
• Zoller, K. (1977). Deterministic multi-item inventory systems with limited capacity. Management Science, 24, 451–455.10.1287/mnsc.24.4.451
   Web of Science ®Google Scholar