IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/19990092.html
   My bibliography  Save this paper

A Branch and Price Algorithm for the Multi-Period Single-Sourcing Problem

Author

Listed:
  • Richard Freling

    (Erasmus University Rotterdam and Ortec Consultants BV, Gouda)

  • H. Edwin Romeijn

    (University of Florida)

  • Dolores Romero Morales

    (Erasmus University Rotterdam)

  • Albert P.M. Wagelmans

    (Erasmus University Rotterdam)

Abstract

In this paper we propose a Branch and Price algorithm for solving multi-periodsingle-sourcing problems. In particular, we generalize a Branch and Price algorithm thatwas developed for the Generalized Assignment Problem (GAP) to a class of convexassignment problems. We then identify an important subclass of problems, containing manyvariants of the multi-period single-sourcing problem (MPSSP), as well as variants of theGAP, for which we derive an efficient solution procedure for the pricing problem, acritical factor in the efficiency of the Branch and Price algorithm. We execute anextensive numerical comparison between the performances of the Branch and Price algorithmand the MIP solver of CPLEX for a particular variant of the MPSSP.

Suggested Citation

  • Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P.M. Wagelmans, 1999. "A Branch and Price Algorithm for the Multi-Period Single-Sourcing Problem," Tinbergen Institute Discussion Papers 99-092/4, Tinbergen Institute.
    • Handle: RePEc:tin:wpaper:19990092
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/99092.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
    2. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    3. 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.
    4. Joseph B. Mazzola & Alan W. Neebe, 1986. "Resource-Constrained Assignment Scheduling," Operations Research, INFORMS, vol. 34(4), pages 560-572, August.
    5. A. M. Geoffrion & G. W. Graves, 1974. "Multicommodity Distribution System Design by Benders Decomposition," Management Science, INFORMS, vol. 20(5), pages 822-844, January.
    6. Cattrysse, Dirk. G. & Salomon, Marc & Van Wassenhove, Luk N., 1994. "A set partitioning heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 72(1), pages 167-174, January.
    7. Jacques A. Ferland & Alain Hertz & Alain Lavoie, 1996. "An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques," Operations Research, INFORMS, vol. 44(2), pages 347-359, April.
    8. Fleischmann, Bernhard, 1993. "Designing distribution systems with transport economies of scale," European Journal of Operational Research, Elsevier, vol. 70(1), pages 31-42, October.
    9. Duran, F., 1987. "A large mixed integer production and distribution program," European Journal of Operational Research, Elsevier, vol. 28(2), pages 207-217, February.
    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. Romeijn, H.E. & Romero Morales, D., 2000. "A Greedy Heuristic for a Three-Level Multi-Period Single-Sourcing Problem," ERIM Report Series Research in Management ERS-2000-04-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.
    2. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    3. H. Edwin Romeijn & Dolores Romero Morales, 2003. "An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 412-437, August.
    4. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    5. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    6. Romeijn, H.E. & Romero Morales, D., 2000. "A Greedy Heuristic for a Three-Level Multi-Period Single-Sourcing Problem," ERIM Report Series Research in Management ERS-2000-04-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    7. Thomas C. Sharkey & Joseph Geunes & H. Edwin Romeijn & Zuo‐Jun Max Shen, 2011. "Exact algorithms for integrated facility location and production planning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(5), pages 419-436, August.
    8. Syam Menon & Linus Schrage, 2002. "Order Allocation for Stock Cutting in the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 324-332, April.
    9. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Ravindra K. Ahuja & Wei Huang & H. Edwin Romeijn & Dolores Romero Morales, 2007. "A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 14-26, February.
    11. Daniel Villeneuve & Jacques Desrosiers & Marco Lübbecke & François Soumis, 2005. "On Compact Formulations for Integer Programs Solved by Column Generation," Annals of Operations Research, Springer, vol. 139(1), pages 375-388, October.
    12. Zeger Degraeve & Marc Peeters, 2003. "Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 58-81, February.
    13. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
    14. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    15. 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.
    16. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    17. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    18. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    19. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    20. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:tin:wpaper:19990092. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    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.