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

Dual‐ascent and primal heuristics for production‐assembly‐distribution system design

Author

Listed:
  • Dong Liang
  • Wilbert E. Wilhelm

Abstract

This article proposes two dual‐ascent algorithms and uses each in combination with a primal drop heuristic embedded within a branch and bound framework to solve the uncapacitated production assembly distribution system (i.e., supply chain) design problem, which is formulated as a mixed integer program. Computational results indicate that one approach, which combines primal drop and dual‐ascent heuristics, can solve instances within reasonable time and prescribes solutions with gaps between the primal and dual solution values that are less than 0.15%, an efficacy suiting it for actual large‐scale applications. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013

Suggested Citation

  • Dong Liang & Wilbert E. Wilhelm, 2013. "Dual‐ascent and primal heuristics for production‐assembly‐distribution system design," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 1-18, February.
    • Handle: RePEc:wly:navres:v:60:y:2013:i:1:p:1-18
    DOI: 10.1002/nav.21515
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21515
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21515?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. 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.
    2. Cynthia Barnhart & Yosef Sheffi, 1993. "A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 27(2), pages 102-117, May.
    3. Trevor Hale & Christopher Moberg, 2003. "Location Science Research: A Review," Annals of Operations Research, Springer, vol. 123(1), pages 21-35, October.
    4. Mark Daskin & Collette Coullard & Zuo-Jun Shen, 2002. "An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results," Annals of Operations Research, Springer, vol. 110(1), pages 83-106, February.
    5. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, June.
    6. Herrmann, J. W. & Ioannou, G. & Minis, I. & Proth, J. M., 1996. "A dual ascent approach to the fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 95(3), pages 476-490, December.
    7. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    8. E. Powell Robinson, Jr. & Li-Lian Gao, 1996. "A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging," Management Science, INFORMS, vol. 42(11), pages 1556-1564, November.
    9. Gendron, Bernard, 2002. "A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"," European Journal of Operational Research, Elsevier, vol. 138(3), pages 671-675, May.
    10. Hinojosa, Y. & Puerto, J. & Fernandez, F. R., 2000. "A multiperiod two-echelon multicommodity capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 271-291, June.
    11. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    12. Guignard, Monique & Opaswongkarn, Kongkiat, 1990. "Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems," European Journal of Operational Research, Elsevier, vol. 46(1), pages 73-83, May.
    13. Guignard, Monique, 1988. "A Lagrangean dual ascent algorithm for simple plant location problems," European Journal of Operational Research, Elsevier, vol. 35(2), pages 193-200, May.
    14. Jakob Krarup, 2007. "Dual ascent: variations of a theme," Annals of Operations Research, Springer, vol. 149(1), pages 137-145, February.
    15. Antonio Frangioni & Giorgio Gallo, 1999. "A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 370-393, November.
    16. Mark S. Daskin & Lawrence V. Snyder & Rosemary T. Berger, 2005. "Facility Location in Supply Chain Design," Springer Books, in: André Langevin & Diane Riopel (ed.), Logistics Systems: Design and Optimization, chapter 0, pages 39-65, Springer.
    17. Jaroslav Janáček & Ľuboš Buzna, 2008. "An acceleration of Erlenkotter-Körkel’s algorithms for the uncapacitated facility location problem," Annals of Operations Research, Springer, vol. 164(1), pages 97-109, November.
    18. Wilhelm, Wilbert & Liang, Dong & Rao, Brijesh & Warrier, Deepak & Zhu, Xiaoyan & Bulusu, Sharath, 2005. "Design of international assembly systems and their supply chains under NAFTA," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 467-493, November.
    19. Zuo-Jun Max Shen & Collette Coullard & Mark S. Daskin, 2003. "A Joint Location-Inventory Model," Transportation Science, INFORMS, vol. 37(1), pages 40-55, February.
    20. Guignard, Monique & Rosenwein, Moshe B., 1989. "An application-oriented guide for designing Lagrangean dual ascent algorithms," European Journal of Operational Research, Elsevier, vol. 43(2), pages 197-205, November.
    21. M. Gisela Bardossy & S. Raghavan, 2010. "Dual-Based Local Search for the Connected Facility Location and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 584-602, November.
    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. Jahani, Hamed & Abbasi, Babak & Sheu, Jiuh-Biing & Klibi, Walid, 2024. "Supply chain network design with financial considerations: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 312(3), pages 799-839.

    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. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    2. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    3. Li, Xiaopeng, 2013. "An integrated modeling framework for design of logistics networks with expedited shipment services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 46-63.
    4. Schuster Puga, Matías & Tancrez, Jean-Sébastien, 2017. "A heuristic algorithm for solving large location–inventory problems with demand uncertainty," European Journal of Operational Research, Elsevier, vol. 259(2), pages 413-423.
    5. Schuster Puga, Matías & Minner, Stefan & Tancrez, Jean-Sébastien, 2019. "Two-stage supply chain design with safety stock placement decisions," International Journal of Production Economics, Elsevier, vol. 209(C), pages 183-193.
    6. Jabbarzadeh, Armin & Fahimnia, Behnam & Seuring, Stefan, 2014. "Dynamic supply chain network design for the supply of blood in disasters: A robust model with real world application," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 225-244.
    7. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
    8. Renata Turkeš & Kenneth Sörensen & Daniel Palhazi Cuervo, 2021. "A matheuristic for the stochastic facility location problem," Journal of Heuristics, Springer, vol. 27(4), pages 649-694, August.
    9. Tancrez, Jean-Sébastien & Lange, Jean-Charles & Semal, Pierre, 2012. "A location-inventory model for large three-level supply chains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 485-502.
    10. Yang, Yuwen & Bidkhori, Hoda & Rajgopal, Jayant, 2021. "Optimizing vaccine distribution networks in low and middle-income countries," Omega, Elsevier, vol. 99(C).
    11. Ross, Anthony & Khajehnezhad, Milad & Otieno, Wilkistar & Aydas, Osman, 2017. "Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: A multi-echelon formulation," European Journal of Operational Research, Elsevier, vol. 259(2), pages 664-676.
    12. Turken, Nazli & Carrillo, Janice & Verter, Vedat, 2017. "Facility location and capacity acquisition under carbon tax and emissions limits: To centralize or to decentralize?," International Journal of Production Economics, Elsevier, vol. 187(C), pages 126-141.
    13. Wu, Xin & Nie, Lei & Xu, Meng & Zhao, Lili, 2019. "Distribution planning problem for a high-speed rail catering service considering time-varying demands and pedestrian congestion: A lot-sizing-based model and decomposition algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 61-89.
    14. Leyla Ozsen & Collette R. Coullard & Mark S. Daskin, 2008. "Capacitated warehouse location model with risk pooling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 295-312, June.
    15. Zhalechian, M. & Tavakkoli-Moghaddam, R. & Zahiri, B. & Mohammadi, M., 2016. "Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 182-214.
    16. Wenjun Ni & Jia Shu & Miao Song & Dachuan Xu & Kaike Zhang, 2021. "A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 86-104, January.
    17. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    18. Farahani, Reza Zanjirani & Rezapour, Shabnam & Drezner, Tammy & Fallah, Samira, 2014. "Competitive supply chain network design: An overview of classifications, models, solution techniques and applications," Omega, Elsevier, vol. 45(C), pages 92-118.
    19. Yu Li & Jia Shu & Xi Wang & Naihua Xiu & Dachuan Xu & Jiawei Zhang, 2013. "Approximation Algorithms for Integrated Distribution Network Design Problems," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 572-584, August.
    20. M. Melo & S. Nickel & F. Saldanha-da-Gama, 2014. "An efficient heuristic approach for a multi-period logistics network redesign problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 80-108, April.

    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:60:y:2013:i:1:p:1-18. 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.