IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v29y2021i3d10.1007_s11750-020-00582-x.html
   My bibliography  Save this article

An exact column-generation approach for the lot-type design problem

Author

Listed:
  • Miriam Kießling

    (Universität Bayreuth)

  • Sascha Kurz

    (Universität Bayreuth)

  • Jörg Rambau

    (Universität Bayreuth)

Abstract

We consider a fashion discounter distributing its many branches with integral multiples from a set of available lot-types. For the problem of approximating the branch and size dependent demand using those lots we propose a tailored exact column generation approach assisted by fast algorithms for intrinsic subproblems, which turns out to be very efficient on our real-world instances as well as on random instances.

Suggested Citation

  • Miriam Kießling & Sascha Kurz & Jörg Rambau, 2021. "An exact column-generation approach for the lot-type design problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 741-780, October.
    • Handle: RePEc:spr:topjnl:v:29:y:2021:i:3:d:10.1007_s11750-020-00582-x
    DOI: 10.1007/s11750-020-00582-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-020-00582-x
    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/s11750-020-00582-x?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. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Václavík, Roman & Novák, Antonín & Šůcha, Přemysl & Hanzálek, Zdeněk, 2018. "Accelerating the Branch-and-Price Algorithm Using Machine Learning," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1055-1069.
    3. Rothenbächer, Ann-Kathrin & Drexl, Michael & Irnich, Stefan, 2016. "Branch-and-price-and-cut for a service network design and hub location problem," European Journal of Operational Research, Elsevier, vol. 255(3), pages 935-947.
    4. Sascha Kurz & Jörg Rambau & Jörg Schlüchtermann & Rainer Wolf, 2015. "The Top-Dog Index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches," Annals of Operations Research, Springer, vol. 229(1), pages 541-563, June.
    5. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    6. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    7. Ahmed M. Marzouk & Erick Moreno-Centeno & Halit Üster, 2016. "A Branch-and-Price Algorithm for Solving the Hamiltonian p -Median Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 674-686, November.
    8. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
    9. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    10. Marshall Fisher & Ramnath Vaidyanathan, 2014. "A Demand Estimation Procedure for Retail Assortment Optimization with Results from Implementations," Management Science, INFORMS, vol. 60(10), pages 2401-2415, October.
    11. Kamrul Ahsan & Abdullahil Azeem, 2010. "Insights of apparel supply chain operations: a case study," International Journal of Integrated Supply Management, Inderscience Enterprises Ltd, vol. 5(4), pages 322-343.
    12. Caleb C. Fast & Illya V. Hicks, 2017. "A Branch Decomposition Algorithm for the p -Median Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 474-488, August.
    13. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
    Full references (including those not matched with items on IDEAS)

    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. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    2. Baldacci, Roberto & Hoshino, Edna A. & Hill, Alessandro, 2023. "New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 538-553.
    3. Shen, Yunzhuang & Sun, Yuan & Li, Xiaodong & Eberhard, Andrew & Ernst, Andreas, 2023. "Adaptive solution prediction for combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1392-1408.
    4. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    5. Wang, Zheng & Sheu, Jiuh-Biing, 2019. "Vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 350-364.
    6. Jing-Quan Li, 2014. "Transit Bus Scheduling with Limited Energy," Transportation Science, INFORMS, vol. 48(4), pages 521-539, November.
    7. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    8. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    9. Yael Grushka-Cockayne & Bert De Reyck & Zeger Degraeve, 2008. "An Integrated Decision-Making Approach for Improving European Air Traffic Management," Management Science, INFORMS, vol. 54(8), pages 1395-1409, August.
    10. Silke Jütte & Marc Albers & Ulrich W. Thonemann & Knut Haase, 2011. "Optimizing Railway Crew Scheduling at DB Schenker," Interfaces, INFORMS, vol. 41(2), pages 109-122, April.
    11. Shyam S. G. Perumal & Jesper Larsen & Richard M. Lusby & Morten Riis & Tue R. L. Christensen, 2022. "A column generation approach for the driver scheduling problem with staff cars," Public Transport, Springer, vol. 14(3), pages 705-738, October.
    12. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.
    13. Akbarzadeh, Babak & Moslehi, Ghasem & Reisi-Nafchi, Mohammad & Maenhout, Broos, 2019. "The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling," European Journal of Operational Research, Elsevier, vol. 278(2), pages 596-614.
    14. Abbink, E.J.W., 2008. "Solving large scale crew scheduling problems by using iterative partitioning," Econometric Institute Research Papers EI 2008-03, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Kristiansen, Simon & Sørensen, Matias & Stidsen, Thomas R., 2011. "Elective course planning," European Journal of Operational Research, Elsevier, vol. 215(3), pages 713-720, December.
    16. Louwerse, I. & Mijnarends, J. & Meuffels, I. & Huisman, D. & Fleuren, H.A., 2012. "Scheduling Movements in the Network of an Express Service Provider," Econometric Institute Research Papers EI 2012-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Panagiotis Andrianesis & Dimitris Bertsimas & Michael C. Caramanis & William W. Hogan, 2020. "Computation of Convex Hull Prices in Electricity Markets with Non-Convexities using Dantzig-Wolfe Decomposition," Papers 2012.13331, arXiv.org, revised Oct 2021.
    18. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    19. Guy Desaulniers & Jørgen G. Rakke & Leandro C. Coelho, 2016. "A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 50(3), pages 1060-1076, August.
    20. Bredström, David & Jörnsten, Kurt & Rönnqvist, Mikael, 2007. "Searching for optimal integer solutions to set partitioning problems using column generation," Discussion Papers 2007/20, Norwegian School of Economics, Department of Business and Management Science.

    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:topjnl:v:29:y:2021:i:3:d:10.1007_s11750-020-00582-x. 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.