870
Views
52
CrossRef citations to date
0
Altmetric
Articles

Multi-item production routing problem with backordering: a MILP approach

&
Pages 1076-1093 | Received 22 Mar 2013, Accepted 14 Apr 2015, Published online: 08 Jun 2015

References

  • Abdelmaguid, T. F., and M. M. Dessouky. 2006. “A Genetic Algorithm Approach to the Integrated Inventory-distribution Problem.” International Journal of Production Research 44 (21): 4445–4464.
  • Abdelmaguid, T. F., M. M. Dessouky, and F. Ordóñez. 2009. “Heuristic Approaches for the Inventory-routing Problem with Backlogging.” Computers & Industrial Engineering 56 (4): 1519–1534.
  • Absi, N., C. Archetti, S. Dauzère-pérès, and D. Feillet. 2013. “A Two-phase Iterative Heuristic Approach for the Production Routing Problem.” EMSE Working Paper CMP-SFL 2013/1, Ecole des Mines de Saint Etienne.
  • Absi, N., and S. Kedad-Sidhoum. 2007. “MIP-based Heuristics for Multi-item Capacitated Lot-sizing Problem with Setup Times and Shortage Costs.” RAIRO-Operations Research 41 (2): 171–192.
  • Adulyasak, Y., J.-F. Cordeau, and R. Jans. 2012. “Optimization-based Adaptive Large Neighborhood Search for the Production Routing Problem.” Transportation Science 48 (1): 20–45.
  • Adulyasak, Y., J.-F. Cordeau, and R. Jans. 2014. “The Production Routing Problem: A Review of Formulations and Solution Algorithms.” Computers & Operations Research 55 (Mar. 2015): 141–152. doi:10.1016/j.cor.2014.01.0111-12.
  • Aghezzaf, E., Y. Zhong, B. Raa, and M. Mateo. 2012. “Analysis of the Single-vehicle Cyclic Inventory Routing Problem.” International Journal of Systems Science 43 (11): 2040–2049.
  • Akartunalı, K., and A. J. Miller. 2009. “A Heuristic Approach for Big Bucket Multi-level Production Planning Problems.” European Journal of Operational Research 193 (2): 396–411.
  • Andersson, H., A. Hoff, M. Christiansen, G. Hasle, and A. Løkketangen. 2010. “Industrial Aspects and Literature Survey: Combined Inventory Management and Routing.” Computers & Operations Research 37 (9): 1515–1536.
  • Archetti, C., L. Bertazzi, G. Laporte, and M. G. Speranza. 2007. “A Branch-and-cut Algorithm for a Vendor-managed Inventory-routing Problem.” Transportation Science 41 (3): 382–391.
  • Archetti, C., L. Bertazzi, G. Paletta, and M. G. Speranza. 2011. “Analysis of the Maximum Level Policy in a Production-distribution System.” Computers & Operations Research 38 (12): 1731–1746.
  • Armentano, V. A., A. L. Shiguemoto, and A. Løkketangen. 2011. “Tabu Search with Path Relinking for an Integrated Production-distribution Problem.” Computers & Operations Research 38 (8): 1199–1209.
  • Bard, J. F., L. Huang, P. Jaillet, and M. Dror. 1998. “A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities.” Transportation Science 32 (2): 189–203.
  • Bard, J. F., and N. Nananukul. 2009. “The Integrated Production, Inventory, Distribution, and Routing Problem.” Journal of Scheduling 12 (3): 257–280.
  • Bard, J. F., and N. Nananukul. 2010. “A Branch-and-price Algorithm for an Integrated Production and Inventory Routing Problem.” Computers & Operations Research 37 (12): 2202–2217.
  • Bertazzi, L., G. Paletta, and M. G. Speranza. 2005. “Minimizing the Total Cost in an Integrated Vendor-managed Inventory System.” Journal of Heuristics 11 (5–6): 393–419.
  • Boudia, M., S. Dauzère-Pérès, C. Prins, and M. A. O. Louly. 2006. “Integrated Optimization of Production and Distribution for Several Products.” 2006 International Conference on Service Systems and Service Management, 1 (Oct): 272–277. France: University of Technology of Troyes.
  • Boudia, M., M. A. O. Louly, and C. Prins. 2007. “A Reactive GRASP and Path Relinking for a Combined Production-distribution Problem.” Computers & Operations Research 34 (11): 3402–3419.
  • Boudia, M., and C. Prins. 2009. “A Memetic Algorithm with Dynamic Population Management for an Integrated Production-distribution Problem.” European Journal of Operational Research 195 (3): 703–715.
  • Brahimi, N., S. Dauzère-Pérès, N. M. Najid, and A. Nordli. 2006. “Single Item Lot Sizing Problems.” European Journal of Operational Research 168 (1): 1–16.
  • Campo, Katia, Els Gijsbrechts, and Patricia Nisol. 2003. “The Impact of Retailer Stockouts on Whether, How Much, and What to Buy.” International Journal of Research in Marketing 20 (3): 273–286.
  • Chandra, P. 1993. “A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements.” Journal of the Operational Research Society 44 (7): 681–692.
  • Chandra, P., and M. L. Fisher. 1994. “Coordination of Production and Distribution Planning.” European Journal of Operational Research 72 (3): 503–517.
  • Coelho, L. C., J.-F. Cordeau, and G. Laporte. 2013. “Thirty Years of Inventory Routing.” Transportation Science 48 (1): 1–19.
  • Desrochers, M., and G. Laporte. 1991. “Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints.” Operations Research Letters 10 (1): 27–36.
  • Ehrenthal, Joachim C. F., and Wolfgang Stölzle. 2013. “An Examination of the Causes for Retail Stockouts.” International Journal of Physical Distribution & Logistics Management 43 (1): 54–69.
  • Federgruen, A., J. Meissner, and M. Tzur. 2007. “Progressive Interval Heuristics for Multi-item Capacitated Lot-sizing Problems.” Operations Research 55 (3): 490–502.
  • Federgruen, A., and M. Tzur. 1993. “The Dynamic Lot-sizing Model with Backlogging: A Simple O(N Log N) Algorithm and Minimal Forecast Horizon Procedure.” Naval Research Logistics 40 (4): 459–478.
  • Federgruen, A., and M. Tzur. 1999. “Time-partitioning Heuristics: Application to One Warehouse, Multiitem, Multiretailer Lot-sizing Problems.” Naval Research Logistics (NRL) 46 (5): 463–486.
  • Ferreira, D., R. Morabito, and S. Rangel. 2010. “Relax and Fix Heuristics to Solve One-stage One-machine Lot-scheduling Models for Small-scale Soft Drink Plants.” Computers & Operations Research 37 (4): 684–691.
  • Fumero, F., and C. Vercellis. 1999. “Synchronized Development of Production, Inventory, and Distribution Schedules.” Transportation Science 33 (3): 330–340.
  • Glover, F. 1975. “Improved Linear Integer Programming Formulations of Nonlinear Integer Problems.” Management Science 22 (4): 455–460.
  • Gröer, C.. 2010. “The VRPH Software.” http://sites.google.com/site/vrphlibrary/.
  • Gröer, C., B. Golden, and E. Wasil. 2010. “A Library of Local Search Heuristics for the Vehicle Routing Problem.” Mathematical Programming Computation 2 (2): 79–101.
  • Gruen, T., and D. S. Corsten. 2007. “A Comprehensive Guide to Retail Out-of-stock Reduction in the Fastmoving Consumer Goods Industry. Research study.” The University of Colorado and the IE Business School Madrid. http://www.nacds.org/pdfs/membership/outofstock.pdf.
  • Jensen, Arne. 1992. “Stockout Costs in Distribution Systems for Spare Parts.” International Journal of Physical Distribution & Logistics Management 22 (1): 15–26.
  • Kara, I., G. Laporte, and T. Bektas. 2004. “A Note on the Lifted Miller-Tucker-Zemlin Subtour Elimination Constraints for the Capacitated Vehicle Routing Problem.” European Journal of Operational Research 158 (3): 793–795.
  • Karimi, B., S. M. T. Fatemi Ghomi, and J. M. Wilson. 2003. “The Capacitated Lot Sizing Problem: A Review of Models and Algorithms.” Omega 31 (5): 365–378.
  • Küçükyavuz, S., and Y. Pochet. 2009. “Uncapacitated Lot Sizing with Backlogging: The Convex Hull.” Mathematical Programming 118 (1): 151–175.
  • Lei, L., S. Liu, A. Ruszczynski, and S. Park. 2006. “On the Integrated Production, Inventory, and Distribution Routing Problem.” IIE Transactions 38 (11): 955–970.
  • Li, F., B. Golden, and E. Wasil. 2005. “Very Large-scale Vehicle Routing: New Test Problems, Algorithms, and Results.” Computers & Operations Research 32 (5): 1165–1179.
  • Liberopoulos, G., I. Tsikis, and S. Delikouras. 2010. “Backorder Penalty Cost Coefficient “b”: What Could it Be?” International Journal of Production Economics 123 (1): 166–178.
  • Marquès, G., C. Thierry, J. Lamothe, and D. Gourc. 2010. “A Review of Vendor Managed Inventory (VMI): From Concept to Processes.” Production Planning & Control 21 (6): 547–561.
  • Millar, H. H., and M. Yang. 1994. “Lagrangian Heuristics for the Capacitated Multi-item Lot-sizing Problem With Backordering.” International Journal of Production Economics 34 (1): 1–15.
  • Moin, N. H., and S. Salhi. 2006. “Inventory Routing Problems: A Logistical Overview.” Journal of the Operational Research Society 58 (9): 1185–1194.
  • Pochet, Y., and L. A. Wolsey. 1988. “Lot-size Models with Back-logging: Strong Reformulations and Cutting Planes.” Mathematical Programming 40 (3): 317–335.
  • Pochet, Y., and L. A. Wolsey. 1991. “Solving Multi-item Lot-sizing Problems Using Strong Cutting Planes.” Management Science 37 (1): 53–67.
  • Pochet, Y., and L. A. Wolsey. 2006. Production Planning by Mixed Integer Programming. New York: Springer.
  • Qu, W. W., J. H. Bookbinder, and P. Iyogun. 1999. “An Integrated Inventory-transportation System with Modified Periodic Policy for Multiple Products.” European Journal of Operational Research 115 (2): 254–269.
  • Ruokokoski, M., O. Solyali, J. F. Cordeau, R. Jans, and H. Sural. 2010. Efficient Formulations and a Branch-and-cut Algorithm for a Production-routing Problem. GERAD Technical Report g-2010-66. Canada: HEC Montréal.
  • Savelsbergh, M., and J.-H. Song. 2007. “Inventory Routing with Continuous Moves.” Computers & Operations Research 34 (6): 1744–1763.
  • Shiguemoto, A., and V. A. Armentano. 2010. “A Tabu Search Procedure for Coordinating Production, Inventory and Distribution Routing Problems.” International Transactions in Operational Research 17 (2): 179–195.
  • Solyalı, O., and H. Süral. 2009. “A Relaxation Based Solution Approach for the Inventory Control and Vehicle Routing Problem in Vendor Managed Systems.” Modeling, Computation adn Optimization 6: 171–189.
  • Solyalı, O., and H. Süral. 2011. “A Branch-and-cut Algorithm Using a Strong Formulation and an a Priori Tour-based Heuristic for an Inventory-routing Problem.” Transportation Science 45 (3): 335–345.
  • Stadtler, H. 2003. “Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-sizing Windows.” Operations Research 51 (3): 487–502.
  • Thangchitpianpol, Pirom, and Suttipong Jumroonrut. 2014. “Production Planning for Animal Food Industry under Demand Uncertainty.” International Journal of Social, Management, Economics and Business Engineering 8 (7): 2192–2195.
  • Toso, E. A. V., R. Morabito, and A. R. Clark. 2009. “Lot Sizing and Sequencing Optimisation at an Animal-feed Plant.” Computers & Industrial Engineering 57 (3): 813–821.
  • Toth, P., and D. Vigo. 2014. Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization. Philadelphia, PA: Society for Industrial and Applied Mathematics.
  • Trigeiro, W. W., L. J. Thomas, and J. O. McClain. 1989. “Capacitated Lot Sizing with Set-up Times.” Management Science 35: 353–366.
  • Vasconcellos, Luis Henrique Rigato, and Mauro, Sampaio. 2009. “The Stockouts Study: An Examination of the Extent and the Causes in the São Paulo Supermarket Sector.” BAR - Brazilian Administration Review 6 (3): 263–279.
  • Walter, C. K., and John R. Grabner. 1975. “Stockout Cost Models: Empirical Tests in a Retail Situation.” Journal of Marketing 39 (3): 56–60.
  • Wolsey, L. A. 1998. Integer Programming. New York: Wiley-Interscience.
  • Zangwill, W. I. 1966. “A Deterministic Multi-period Production Scheduling Model with Backlogging.” Management Science 13 (1): 105–119.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.