IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v258y2017i2d10.1007_s10479-015-1941-2.html
   My bibliography  Save this article

On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization

Author

Listed:
  • Jose L. Andrade-Pineda

    (University of Seville)

  • David Canca

    (University of Seville)

  • Pedro L. Gonzalez-R

    (University of Seville)

Abstract

Applying traditional integer programming techniques in order to solve real logistic problems can be an important challenge. To ensure tractability, real instances are often either simplified in scope or limited in size, given rise to solutions that may not address realistic issues. In this paper we present a novel approach to solve a multicommodity capacitated network flow problem with concave routing costs, considering also outsourcing, overload and underutilization facility costs. It is derived from a real NP production and transportation problem concerning to the processing of biological samples in a large health-care network, with consideration of volume-based price incentives—i.e. economies of scale—on the shipping costs. It is a tactical level model providing the global view of network layout and the coordinating policy among facilities with realistic assessment of long-term operations costs. The goal is to find an efficient resolution procedure in order to integrate it into a Decision Support System used by planners. With this aim, we analyse three alternative methods of linearizing the involved modified all-units discount cost function. Performance of the different modelling techniques is shown through extensive computations.

Suggested Citation

  • Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R, 2017. "On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization," Annals of Operations Research, Springer, vol. 258(2), pages 301-346, November.
    • Handle: RePEc:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-015-1941-2
    DOI: 10.1007/s10479-015-1941-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1941-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-015-1941-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cohn, Amy & Davey, Melinda & Schkade, Lisa & Siegel, Amanda & Wong, Caris, 2008. "Network design and flow problems with cross-arc costs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 890-901, September.
    2. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2003. "A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems," Management Science, INFORMS, vol. 49(9), pages 1268-1273, September.
    3. Anantaram Balakrishnan & Harihara Prasad Natarajan, 2014. "Integrated Procurement Planning in Multi-division Firms," Production and Operations Management, Production and Operations Management Society, vol. 23(10), pages 1795-1810, October.
    4. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    5. Bichler, Martin & Schneider, Stefan & Guler, Kemal & Sayal, Mehmet, 2011. "Compact bidding languages and supplier selection for markets with economies of scale and scope," European Journal of Operational Research, Elsevier, vol. 214(1), pages 67-77, October.
    6. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2013. "A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 643-653, November.
    7. Qin, Hu & Luo, Meifeng & Gao, Xiang & Lim, Andrew, 2012. "The freight allocation problem with all-units quantity-based discount: A heuristic algorithm," Omega, Elsevier, vol. 40(4), pages 415-423.
    8. Ho, William & Xu, Xiaowei & Dey, Prasanta K., 2010. "Multi-criteria decision making approaches for supplier evaluation and selection: A literature review," European Journal of Operational Research, Elsevier, vol. 202(1), pages 16-24, April.
    9. Goossens, D.R. & Maas, A.J.T. & Spieksma, F.C.R. & van de Klundert, J.J., 2007. "Exact algorithms for procurement problems under a total quantity discount structure," European Journal of Operational Research, Elsevier, vol. 178(2), pages 603-626, April.
    10. Arshinder & Kanda, Arun & Deshmukh, S.G., 2008. "Supply chain coordination: Perspectives, empirical studies and research directions," International Journal of Production Economics, Elsevier, vol. 115(2), pages 316-335, October.
    11. Lap Mui Ann Chan & Ana Muriel & Zuo-Jun Max Shen & David Simchi-Levi & Chung-Piaw Teo, 2002. "Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures," Management Science, INFORMS, vol. 48(11), pages 1446-1460, November.
    12. Charles L. Munson, 2007. "The appeal of partially centralised purchasing policies," International Journal of Procurement Management, Inderscience Enterprises Ltd, vol. 1(1/2), pages 117-143.
    13. Jose L. Andrade-Pineda & Pedro L. Gonzalez-R & Jose M. Framinan, 2013. "A Decision-Making Tool for a Regional Network of Clinical Laboratories," Interfaces, INFORMS, vol. 43(4), pages 360-372, August.
    14. Quentin Botton & Bernard Fortz & Luis Gouveia & Michael Poss, 2013. "Benders Decomposition for the Hop-Constrained Survivable Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 13-26, February.
    15. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    16. Jiefeng Xu & Leonard Lu & Fred Glover, 2000. "The deterministic multi-item dynamic lot size problem with joint business volume discount," Annals of Operations Research, Springer, vol. 96(1), pages 317-337, November.
    17. Holmberg, Kaj, 1994. "Solving the staircase cost facility location problem with decomposition and piecewise linearization," European Journal of Operational Research, Elsevier, vol. 75(1), pages 41-61, May.
    18. Mansini, Renata & Savelsbergh, Martin W.P. & Tocchella, Barbara, 2012. "The supplier selection problem with quantity discounts and truckload shipping," Omega, Elsevier, vol. 40(4), pages 445-455.
    19. Lihui Bai & Paul A. Rubin, 2009. "Combinatorial Benders Cuts for the Minimum Tollbooth Problem," Operations Research, INFORMS, vol. 57(6), pages 1510-1522, December.
    20. Li, Han-Lin & Chang, Ching-Ter & Tsai, Jung-Fa, 2002. "Approximately global optimization for assortment problems using piecewise linearization techniques," European Journal of Operational Research, Elsevier, vol. 140(3), pages 584-589, August.
    21. Hammami, Ramzi & Temponi, Cecilia & Frein, Yannick, 2014. "A scenario-based stochastic model for supplier selection in global context with multiple buyers, currency fluctuation uncertainties, and price discounts," European Journal of Operational Research, Elsevier, vol. 233(1), pages 159-170.
    22. Daniel Bienstock & Oktay Günlük, 1996. "Capacitated Network Design---Polyhedral Structure and Computation," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 243-259, August.
    23. Hill, James & Galbreth, Michael, 2008. "A heuristic for single-warehouse multiretailer supply chains with all-unit transportation cost discounts," European Journal of Operational Research, Elsevier, vol. 187(2), pages 473-482, June.
    24. Ahmet B. Keha & Ismael R. de Farias & George L. Nemhauser, 2006. "A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization," Operations Research, INFORMS, vol. 54(5), pages 847-858, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Zhaolin & Ou, Jinwen & Liang, Guitian, 2021. "Optimizing hospital drug procurement with rebate contracts," Omega, Elsevier, vol. 105(C).
    2. Federico Toffano & Michele Garraffa & Yiqing Lin & Steven Prestwich & Helmut Simonis & Nic Wilson, 2022. "A multi-objective supplier selection framework based on user-preferences," Annals of Operations Research, Springer, vol. 308(1), pages 609-640, January.
    3. Sirin Suprasongsin & Pisal Yenradee & Van-Nam Huynh, 2020. "A weight-consistent model for fuzzy supplier selection and order allocation problem," Annals of Operations Research, Springer, vol. 293(2), pages 587-605, October.
    4. Moutushi Chatterjee, 2023. "Multivariate supplier selection for asymmetric specification region: using price and quality," Annals of Operations Research, Springer, vol. 324(1), pages 1023-1040, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. F. J. Hwang & Yao-Huei Huang, 2021. "An effective logarithmic formulation for piecewise linearization requiring no inequality constraint," Computational Optimization and Applications, Springer, vol. 79(3), pages 601-631, July.
    2. Li, Zhaolin & Ou, Jinwen & Liang, Guitian, 2021. "Optimizing hospital drug procurement with rebate contracts," Omega, Elsevier, vol. 105(C).
    3. Ya Ping Fang & Kaiwen Meng & Xiao Qi Yang, 2012. "Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization," Operations Research, INFORMS, vol. 60(2), pages 398-409, April.
    4. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    5. Li, Xin & Ventura, José A. & Venegas, Bárbara B. & Kweon, Sang Jin & Hwang, Seong Wook, 2018. "An integrated acquisition policy for supplier selection and lot sizing considering total quantity discounts and a quality constraint," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 19-40.
    6. Hu, Qian & Lim, Andrew & Zhu, Wenbin, 2015. "The two-dimensional vector packing problem with piecewise linear cost function," Omega, Elsevier, vol. 50(C), pages 43-53.
    7. Manerba, Daniele & Mansini, Renata & Perboli, Guido, 2018. "The Capacitated Supplier Selection problem with Total Quantity Discount policy and Activation Costs under uncertainty," International Journal of Production Economics, Elsevier, vol. 198(C), pages 119-132.
    8. Kirschstein, Thomas & Meisel, Frank, 2019. "A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry," European Journal of Operational Research, Elsevier, vol. 279(2), pages 393-406.
    9. Nowak, Maciek & Hewitt, Mike & Bachour, Hussam, 2019. "Mileage bands in freight transportation," European Journal of Operational Research, Elsevier, vol. 272(2), pages 549-564.
    10. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions," Operations Research, INFORMS, vol. 58(2), pages 303-315, April.
    11. Zheng, Xiao-Xue & Chang, Ching-Ter, 2021. "Topology design of remote patient monitoring system concerning qualitative and quantitative issues," Omega, Elsevier, vol. 98(C).
    12. Zhou, Yuan & Xie, Jinxing, 2014. "Potentially self-defeating: Group buying in a two-tier supply chain," Omega, Elsevier, vol. 49(C), pages 42-52.
    13. Scott, James & Ho, William & Dey, Prasanta K. & Talluri, Srinivas, 2015. "A decision support system for supplier selection and order allocation in stochastic, multi-stakeholder and multi-criteria environments," International Journal of Production Economics, Elsevier, vol. 166(C), pages 226-237.
    14. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    15. Faiza Hamdi & Ahmed Ghorbel & Faouzi Masmoudi & Lionel Dupont, 2018. "Optimization of a supply portfolio in the context of supply chain risk management: literature review," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 763-788, April.
    16. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Ventura, José A. & Valdebenito, Victor A. & Golany, Boaz, 2013. "A dynamic inventory model with supplier selection in a serial supply chain structure," European Journal of Operational Research, Elsevier, vol. 230(2), pages 258-271.
    18. Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
    19. Aly Owida & P.J. Byrne & Cathal Heavey & Paul Blake & Khaled S. El-Kilany, 2016. "A simulation based continuous improvement approach for manufacturing based field repair service contracting," International Journal of Production Research, Taylor & Francis Journals, vol. 54(21), pages 6458-6477, November.
    20. Hu, Kuo-Jen & Yu, Vincent F., 2016. "An integrated approach for the electronic contract manufacturer selection problem," Omega, Elsevier, vol. 62(C), pages 68-81.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-015-1941-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.