IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v50y2003i5p412-437.html
   My bibliography  Save this article

An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case

Author

Listed:
  • H. Edwin Romeijn
  • Dolores Romero Morales

Abstract

The dynamics of the environment in which supply chains evolve requires that companies frequently redesign their logistics distribution networks. In this paper we address a multiperiod single‐sourcing problem that can be used as a strategic tool for evaluating the costs of logistics network designs in a dynamic environment. The distribution networks that we consider consist of a set of production and storage facilities, and a set of customers who do not hold inventories. The facilities face production capacities, and each customer's demand needs to be delivered by a single facility in each period. We deal with the assignment of customers to facilities, as well as the location, timing, and size of inventories. In addition, to mitigate start and end‐of‐study effects, we view the planning period as a typical future one, which will repeat itself. This leads to a cyclic model, in which starting and ending inventories are equal. Based on an assignment formulation of the problem, we propose a greedy heuristic, and prove that this greedy heuristic is asymptotically feasible and optimal in a probabilistic sense. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 412–437, 2003

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:50:y:2003:i:5:p:412-437
    DOI: 10.1002/nav.10068
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10068
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10068?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. A. M. Geoffrion & G. W. Graves, 1974. "Multicommodity Distribution System Design by Benders Decomposition," Management Science, INFORMS, vol. 20(5), pages 822-844, January.
    3. H. Edwin Romeijn & Nanda Piersma, 2000. "A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem," Journal of Combinatorial Optimization, Springer, vol. 4(3), pages 325-355, September.
    4. Fleischmann, Bernhard, 1993. "Designing distribution systems with transport economies of scale," European Journal of Operational Research, Elsevier, vol. 70(1), pages 31-42, October.
    5. Duran, F., 1987. "A large mixed integer production and distribution program," European Journal of Operational Research, Elsevier, vol. 28(2), pages 207-217, February.
    6. Michael A. Trick, 1992. "A linear relaxation heuristic for the generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 137-151, March.
    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. Balachandran Vaidyanathan & Ravindra K. Ahuja, 2010. "Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications," Operations Research, INFORMS, vol. 58(6), pages 1681-1696, December.
    2. Wei Huang & H. Edwin Romeijn & Joseph Geunes, 2005. "The continuous‐time single‐sourcing problem with capacity expansion opportunities," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 193-211, April.
    3. 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.
    4. David A. Goldberg & Martin I. Reiman & Qiong Wang, 2021. "A Survey of Recent Progress in the Asymptotic Analysis of Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1718-1750, June.
    5. 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.

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
    7. Jayaraman, Vaidyanathan & Pirkul, Hasan, 2001. "Planning and coordination of production and distribution facilities for multiple commodities," European Journal of Operational Research, Elsevier, vol. 133(2), pages 394-408, January.
    8. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    9. 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.
    10. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    11. Brech, Claus-Henning & Ernst, Andreas & Kolisch, Rainer, 2019. "Scheduling medical residents’ training at university hospitals," European Journal of Operational Research, Elsevier, vol. 274(1), pages 253-266.
    12. Halit Üster & Panitan Kewcharoenwong, 2011. "Strategic Design and Analysis of a Relay Network in Truckload Transportation," Transportation Science, INFORMS, vol. 45(4), pages 505-523, November.
    13. García Cáceres, Rafael Guillermo & Aráoz Durand, Julián Arturo & Gómez, Fernando Palacios, 2009. "Integral analysis method - IAM," European Journal of Operational Research, Elsevier, vol. 192(3), pages 891-903, February.
    14. Osman, Hany & Demirli, Kudret, 2010. "A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 97-105, March.
    15. 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.
    16. Lahlum, Suzanne M. & Dooley, Frank J., 1996. "The Optimal Number and Size of Fertilizer Plants Under Hazardous Materials Regulations," MPC Reports 231704, North Dakota State University, Upper Great Plains Transportation Institute.
    17. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    18. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    19. Altay, Nezih & Robinson Jr., Powell E. & Bretthauer, Kurt M., 2008. "Exact and heuristic solution approaches for the mixed integer setup knapsack problem," European Journal of Operational Research, Elsevier, vol. 190(3), pages 598-609, November.
    20. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.

    More about this item

    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:wly:navres:v:50:y:2003:i:5:p:412-437. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.