Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem

Published Online:https://doi.org/10.1287/trsc.1090.0267

References

  • Beamon B. M., Fernandes C. Supply-chain network configuration for product recovery. Production Planning Control (2004) 15:270–281CrossrefGoogle Scholar
  • Birge J. R., Louveaux F. A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. (1988) 34:384–392CrossrefGoogle Scholar
  • Bloemhof-Ruwaard J. M., Fleischmann M., van Nunen J. A. E. E., Speranza M. G., Stähly P. Reviewing distribution issues in reverse logistics. New Trends in Distribution Logistics (1999) (Springer, Berlin) Google Scholar
  • Dekker R., Fleischmann M., Inderfurth K., Van Wassennhove L. N.Reverse Logistics: Quantitative Models for Closed-Loop Supply Chains (2004) (Springer, Berlin) CrossrefGoogle Scholar
  • Fleischmann M. Reverse logistics network structures and design. (2001) . ERIM Report Series ERS-2001-52-LIS, Erasmus Research Institute of Management, September, available at http://ssrn.com/abstract=370907Google Scholar
  • Fleischmann M., Beullens P., Bloemhof-Ruwaard J. M., Van Wassenhove L. N. The impact of product recovery on logistics network design. Production Oper. Management (2001) 10:156–173CrossrefGoogle Scholar
  • Fleischmann M., Krikke H. R., Dekker R., Flapper S. D. P. A characterization of logistics networks for product recovery. OMEGA (2000) 28:653–666CrossrefGoogle Scholar
  • Fleischmann M., Bloemhof-Ruwaard J. M., Dekker R., van der Laan E., van Nunen J. A. E. E., Van Wassenhove L. N. Quantitative models for reverse logistics: A review. Eur. J. Oper. Res. (1997) 103:1–17CrossrefGoogle Scholar
  • Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20:822–844LinkGoogle Scholar
  • Glover F. Tabu search—Part 1. J. Comput. (1989) 1:190–206AbstractGoogle Scholar
  • Glover F. Tabu search—Part 2. J. Comput. (1990) 2:4–32AbstractGoogle Scholar
  • Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • Keskin B. B., Üster H. Meta-heuristic approaches with memory and evolution for a multiproduct production/distribution system design problem. Eur. J. Oper. Res. (2007) 182:663–682CrossrefGoogle Scholar
  • Krikke H., Bloemhof-Ruwaard J., Van Wassenhove L. N. Concurrent product and closed-loop supply chain design with an application to refrigerators. Internat. J. Production Res. (2003) 41:3689–3719CrossrefGoogle Scholar
  • Lu Z., Bostel N. A facility location model for logistics systems including reverse flows: The case of remanufacturing activities. Comput. Oper. Res. (2007) 34:299–323CrossrefGoogle Scholar
  • Magnanti T. L., Wong R. T. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. (1981) 29:464–484LinkGoogle Scholar
  • Sahyouni K., Savaskan R. C., Daskin M. S. A facility location model for bidirectional flows. Transportation Sci. (2007) 41:484–499LinkGoogle Scholar
  • Sim E., Jung S., Kim H., Park J., Kalyanmoy D., Poli R., Banzhaf W., Beyer H.-G., Burke E. K., Darwen P. J., Dasgupta D., Floreano D., Foster J. A., Harman M., Holland O., et al. A generic network design for a closed-loop supply chain using genetic algorithm. GECCO (2) (2004) 3103(Springer, Berlin) 1214–1225Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Üster H., Easwaran G., Akçalı E., Çetinkaya S. Benders decomposition with alternative multiple cuts for a multiproduct closed-loop supply chain network design model. Naval Res. Logist. (2007) 54:890–907CrossrefGoogle Scholar
  • Van Roy T. J. A cross decomposition algorithm for capacitated facility location. Oper. Res. (1986) 34:145–163LinkGoogle Scholar
  • Wentges P. Accelerating Benders' decomposition for the capacitated facility location problem. Math. Methods Oper. Res. (1996) 44:267–290CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.