Free Access
RAIRO-Oper. Res.
Volume 54, Number 3, May-June 2020
Page(s) 749 - 782
Published online 12 March 2020
  • A.I. Ali and D.J. O’Connor, Using truck-inventory-cost to obtain solutions to multi-period logistics models. Int. J. Prod. Econ. 143 (2013) 144–150. [Google Scholar]
  • S. Anily and M. Tzur, Shipping multiple items by capacitated vehicles: an optimal dynamic programming approach. Trans. Sci. 39 (2005) 233–248. [CrossRef] [Google Scholar]
  • S. Anily and M. Tzur, Algorithms for the multi-item multi-vehicles dynamic lot sizing problem. Nav. Res. Logist. 53 (2006) 157–169. [CrossRef] [Google Scholar]
  • N. Asgari, R.Z. Farahani, H. Rashidi-Bajgan and M.S. Sajadieh, Developing model-based software to optimise wheat storage and transportation: a real-world application. Appl. Soft Comput. 13 (2013) 1074–1084. [Google Scholar]
  • T.A. Baldo, M.O. Santos, B. Almada-Lobo and R. Morabito, An optimization approach for the lot sizing and scheduling problem in the brewery industry. Comput. Ind. Eng. 72 (2014) 58–71. [Google Scholar]
  • W.J. Baumol and H.D. Vinod, An inventory theoretic model of freight transport demand. Manag. Sci. 16 (1970) 413–421. [CrossRef] [Google Scholar]
  • J.J. Bravo and C.J. Vidal, Freight transportation function in supply chain optimization models: a critical review of recent trends. Expert Syst. App. 40 (2013) 6742–6757. [CrossRef] [Google Scholar]
  • D. Carlsson, P. Flisberg and M. Rönnqvist, Using robust optimization for distribution and inventory planning for a large pulp producer. Comput. Oper. Res. 44 (2014) 214–225. [Google Scholar]
  • H. Chen, Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems. Omega 56 (2015) 25–36. [Google Scholar]
  • K. Deb. An introduction to genetic algorithms, Sadhana 24 (1999) 293–315. [CrossRef] [Google Scholar]
  • Department of Food and Public Distribution, Ministry of Consumer Affairs, Food and Public Distribution, G. of I, e-PDS portal of India. Available from (2015) [Google Scholar]
  • Department of Food and Public Distribution, Ministry of Consumer Affairs, Food and Public Distribution, G. of I, Foodgrain bulletin. Available from (2015). [Google Scholar]
  • Á.P. Dorneles, O.C. de Araújo and L.S. Buriol, A fix-and-optimize heuristic for the high school timetabling problem. Comput. Oper. Res. 52 (2014) 29–38. [Google Scholar]
  • J. Drechsel and A. Kimms, Cooperative lot sizing with transshipments and scarce capacities: solutions and fair cost allocations. Int. J. Prod. Res. 49 (2011) 2643–2668. [Google Scholar]
  • K. Ertogral, M. Darwish and M. Ben-Daya, Production and shipment lot sizing in a vendor–buyer supply chain with transportation cost. Eur. J. Oper. Res. 176 (2007) 1592–1606. [Google Scholar]
  • A. Franz, J. Rieck and J. Zimmermann, Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages. Ann. Oper. Res. 274 (2019) 241–265. [Google Scholar]
  • M.M. Furlan and M.O. Santos, BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem. J. Intell. Manuf. 28 (2017) 929–944. [Google Scholar]
  • A. Ghaderi and M.S. Jabalameli, Modeling the budget-constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: a case study of health care. Math. Comput. Model. 57 (2013) 382–400. [Google Scholar]
  • H.G. Gören and S. Tunal, Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach. Appl. Intell. 42 (2015) 805–816. [CrossRef] [Google Scholar]
  • H.G. Goren, S. Tunali and R. Jans, A hybrid approach for the capacitated lot sizing problem with setup carryover. Int. J. Prod. Res. 50 (2012) 1582–1597. [Google Scholar]
  • L. Guimaraes, D. Klabjan and B. Almada-Lobo, Pricing, relaxing and fixing under lot sizing and scheduling. Eur. J. Oper. Res. 230 (2013) 399–411. [Google Scholar]
  • L. Guimarães, P. Amorim, F. Sperandio, F. Moreira and B. Almada-Lobo, Annual distribution budget in the beverage industry: a case study. Interfaces 44 (2014) 605–626. [Google Scholar]
  • P. Guo, W. Cheng, Y. Wang and N. Boysen, Gantry crane scheduling in intermodal rail-road container terminals. Int. J. Prod. Res. 56 (2018) 5419–5436. [Google Scholar]
  • S. Helber and F. Sahling, A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int. J. Prod. Econ. 123 (2010) 247–256. [Google Scholar]
  • S. Helber, F. Sahling and K. Schimmelpfeng, Dynamic capacitated lot sizing with random demand and dynamic safety stocks. OR Spect. 35 (2013) 75–105. [CrossRef] [Google Scholar]
  • S. Helber, D. Böhme, F. Oucherif, S. Lagershausen and S. Kasper, A hierarchical facility layout planning approach for large and complex hospitals. Flexible Serv. Manuf. J. 28 (2016) 5–29. [CrossRef] [Google Scholar]
  • H. Hwang and K.I. Sohn, An optimal policy for the dynamic transportation-inventory model with deteriorating items. IIE Trans. 17 (1985) 233–241. [Google Scholar]
  • Indian Railways, Freight Operations Information System. Available from (2015). [Google Scholar]
  • R.J. James and B. Almada-Lobo, Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. 38 (2011) 1816–1825. [Google Scholar]
  • W. Jaruphongsa, S. Cetinkaya and C.Y. Lee, A dynamic lot-sizing model with multi-mode replenishments: polynomial algorithms for special cases with dual and multiple modes. IIE Trans. 37 (2005) 453–467. [Google Scholar]
  • W. Jaruphongsa, S. Çetinkaya and C.Y. Lee, Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions. Oper. Res. Lett. 35 (2007) 813–822. [CrossRef] [Google Scholar]
  • N. Jawahar and N. Balaji, A genetic algorithm based heuristic to the multi-period fixed charge distribution problem. Appl. Soft Comput. 12 (2012) 682–699. [Google Scholar]
  • Y. Jin and A. Muriel, Single-warehouse multi-retailer inventory systems with full truckload shipments. Nav. Res. Logist. (NRL) 56 (2009) 450–464. [CrossRef] [Google Scholar]
  • J.H. Kang and Y.D. Kim, Coordination of inventory and transportation managements in a two-level supply chain. Int. J. Prod. Econ. 123 (2010) 137–145. [Google Scholar]
  • J.U. Kim and Y.D. Kim, A Lagrangian relaxation approach to multi-period inventory/distribution planning. J. Oper. Res. Soc. 51 (2000) 364–370. [Google Scholar]
  • B.S. Kim and W.S. Lee, Meta-heuristic algorithms for a multi-product dynamic lot-sizing problem with a freight container cost. Ind. Eng. Manag. Syst. 11 (2012) 288–298. [Google Scholar]
  • J.C. Lang and Z.J.M. Shen, Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. Eur. J. Oper. Res. 214 (2011) 595–605. [Google Scholar]
  • C.Y. Lee, S. Çetinkaya and W. Jaruphongsa, A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. 51 (2003) 735–747. [Google Scholar]
  • W.S. Lee, J.H. Han and S.J. Cho, A heuristic algorithm for a multi-product dynamic lot-sizing and shipping problem. Int. J. Prod. Econ. 98 (2005) 204–214. [Google Scholar]
  • B.K. Lee, K.H. Kang and Y.H. Lee, Decomposition heuristic to minimize total cost in a multi-level supply chain network. Comput. Ind. Eng. 54 (2008) 945–959. [Google Scholar]
  • Y. Li and Z. Chen, An optimal model of dynamic lot-sizing with transportation decision and an improved ACO algorithm. Int. J. Ind. Syst. Eng. 22 (2016) 121–144. [Google Scholar]
  • C.L. Li, V.N. Hsu and W.Q. Xiao, Dynamic lot sizing with batch ordering and truckload discounts. Oper. Res. 52 (2004) 639–654. [Google Scholar]
  • S.A. Lippman, Optimal inventory policy with multiple set-up costs. Manag. Sci. 16 (1969) 118–138. [CrossRef] [Google Scholar]
  • H.R. Lourenço, O.C. Martin and T. Stützle, Iterated local search. In: Handbook of Metaheuristics. Springer, Boston, MA (2003) 320–353. [CrossRef] [Google Scholar]
  • M.C. Luizelli, W.L. da Costa Cordeiro, L.S. Buriol and L.P. Gaspary, A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining. Comput. Commun. 102 (2017) 67–77. [Google Scholar]
  • A. Moreno, D. Alem and D. Ferreira, Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics. Comput. Oper. Res. 69 (2016) 79–96. [Google Scholar]
  • Y. Pochet and L.A. Wolsey, Production Planning by Mixed Integer Programming. Springer Science and Business Media, Berlin, 2006. [Google Scholar]
  • B. Pourghannnad, A. Kazemi, N. Shahraki, P. Chiniforooshan and M. Azizmohammadi, Developing a new model for dynamic Vendor Managed Inventory with considering time value of money. Int. J. Logist. Syst. Manag. 20 (2015) 411–427. [CrossRef] [Google Scholar]
  • N. Rizk, A. Martel and A. Ramudhin, A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs. Int. J. Prod. Econ. 102 (2006) 344–357. [Google Scholar]
  • F. Sahling, Integration of vendor selection into production and remanufacturing planning subject to emission constraints. Int. J. Prod. Res. 54 (2016) 3822–3836. [Google Scholar]
  • F. Sahling, L. Buschkühl, H. Tempelmeier and S. Helber, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Comput. Oper. Res. 36 (2009) 2546–2553. [Google Scholar]
  • E. Sancak and F.S. Salman, Multi-item dynamic lot-sizing with delayed transportation policy. Int. J. Prod. Econ. 131 (2011) 595–603. [Google Scholar]
  • F. Seeanner, B. Almada-Lobo and H. Meyr, Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems. Comput. Oper. Res. 40 (2013) 303–317. [Google Scholar]
  • Ç. Sel and B. Bilgen, Hybrid simulation and MIP based heuristic algorithm for the production and distribution planning in the soft drink industry. J. Manuf. Syst. 33 (2014) 385–399. [Google Scholar]
  • H. Stadtler and F. Sahling, A lot-sizing and scheduling model for multi-stage flow lines with zero lead times. Eur. J. Oper. Res. 225 (2013) 404–419. [Google Scholar]
  • A. Tanksale and J.K. Jha, An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India. INFOR: Info. Syst. Oper. Res. 54 (2016) 355–379. [Google Scholar]
  • A. Tanksale and J.K. Jha, Solving multi-region multi-facility inventory allocation and transportation problem: a case of Indian public distribution system. Comput. Ind. Eng. 110 (2017) 175–190. [Google Scholar]
  • H. Tempelmeier and K. Copil, Capacitated lot sizing with parallel machines, sequence-dependent setups and a common setup operator. OR Spect. 38 (2016) 819–847. [CrossRef] [Google Scholar]
  • C.F.M. Toledo, R.R.R. De Oliveira and P.M. FrançA, A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40 (2013) 910–919. [Google Scholar]
  • C.F. Toledo, M. da Silva Arantes, M.Y.B. Hossomi, P.M. França and K. Akartunalı, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21 (2015) 687–717. [CrossRef] [Google Scholar]
  • A.M. Turhan and B. Bilgen, Mixed integer programming based heuristics for the Patient Admission Scheduling problem. Comput. Oper. Res. 80 (2017) 38–49. [Google Scholar]
  • L. van Norden and S. van de Velde, Multi-product lot-sizing with a transportation capacity reservation contract. Eur. J. Oper. Res. 165 (2005) 127–138. [Google Scholar]
  • S. Venkatachalam and A. Narayanan, Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost. Int. J. Prod. Res. 54 (2016) 4087–4103. [Google Scholar]
  • H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model. Manag. Sci. 5 (1958) 89–96. [CrossRef] [Google Scholar]
  • W. Wei, L. Guimarães, P. Amorim and B. Almada-Lobo, Tactical production and distribution planning with dependency issues on the production process. Omega 67 (2017) 99–114. [Google Scholar]
  • A. Wolter and S. Helber, Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear. Cent. Eur. J. Oper. Res. 24 (2016) 489–513. [Google Scholar]
  • J. Xiao, C. Zhang, L. Zheng and J.N. Gupta, MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem. Int. J. Prod. Res. 51 (2013) 5011–5028. [Google Scholar]
  • Q.H. Zhao, S. Chen, S.C. Leung and K.K. Lai, Integration of inventory and transportation decisions in a logistics system. Trans. Res. Part E: Logist. Transp. Rev. 46 (2010) 913–925. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.