Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem

References

• Ahuja R. K., Orlin J. B., Pallottino S., Scaparra M. P., Scutellà M. G. A multi-exchange heuristic for the single-source capacitated facility location problem. Management Sci. (2004) 50(6):749–760Link, Google Scholar
• Aksena D., Altinkemer K. A location-routing problem for the conversion to the “click-and-mortar” retailing: The static case. Eur. J. Oper. Res. (2008) 186(2):554–575Crossref, Google Scholar
• Albareda-Sambola M., Fernández E., Laporte G. The capacity and distance constrained plant location problem. Comput. Oper. Res. (2009) 36(2):597–611Crossref, Google Scholar
• Alp O., Erkut E., Drezner Z. An efficient genetic algorithm for the p-median problem. Ann. Oper. Res. (2003) 122(1–4):21–42Crossref, Google Scholar
• Arunapuram S., Mathur K., Solow D. Vehicle routing and scheduling with full truckloads. Transportation Sci. (2003) 37(2):170–182Link, Google Scholar
• Bajestani A., Beck J. C. Scheduling an aircraft repair shop. Proc. 25th Internat. Conf. Automated Planning Scheduling (ICAPS2011) (2011) . ForthcomingGoogle Scholar
• Barceló J., Fernández E., Jornsten K. Computational results from a new Lagrangean relaxation algorithm for the capacitated plant locating problem. Eur. J. Oper. Res. (1991) 53(1):38–45Crossref, Google Scholar
• Beck J. C., Cohen D. Checking-up on branch-and-check. Proc. 16th Internat. Conf. Principles Practice Constraint Programming (CP2010), Vol. 6308 (2010) (Springer, Berlin) 84–98Lecture Notes in Computer ScienceCrossref, Google Scholar
• Benders J. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 4(1):238–252Crossref, Google Scholar
• Benini L., Lombardi M., Mantovani M., Milano M., Ruggiero M., Perron L., Trick M. Multi-stage Benders decomposition for optimizing multicore architectures. Proc. 5th Internat. Conf. Integration AI OR Techniques Constraint Programming Combinat. Optim. Problems (CPAIOR'08), Vol. 5015 (2008) (Springer, Berlin) 36–50Lecture Notes in Computer ScienceCrossref, Google Scholar
• Benoist T., Gaudin E., Rottembourg B., Van Hentenryck P. Constraint programming contribution to Benders decomposition: A case study. Proc. 8th Internat. Conf. Principles Practice of Constraint Programming (CP'2002), Vol. 2470 (2002) (Springer, Berlin) 603–617Lecture Notes in Computer ScienceCrossref, Google Scholar
• Cambazard H., O'Sullivan B., Cohen D. Propagating the bin packing constraint using linear programming. Proc. 16th Internat. Conf. Principles Practice Constraint Programming (CP2010), Vol. 6308 (2010) (Springer, Berlin) 129–141Lecture Notes in Computer ScienceCrossref, Google Scholar
• Ceselli A., Righini G. A branch-and-price algorithm for the capacitated p-median problem. Networks (2005) 45(3):125–142Crossref, Google Scholar
• Chaudry S. S., He S., Chaudry P. E. Solving a class of facility location problems using genetic algorithms. Expert Systems (2003) 20(2):86–91Crossref, Google Scholar
• Chu Y., Xia Q., Régin J.-C., Rueher M. Generating Benders' cuts for a general class of integer programming problems. Proc. 1st Internat. Conf. Integration AI OR Techniques Constraint Programming Combinat. Optim. Problems (CPAIOR'04), Vol. 3011 (2004) (Springer, Berlin) 127–136Lecture Notes in Computer ScienceCrossref, Google Scholar
• Cooper L. Location-allocation problems. Oper. Res. (1963) 11(3):331–343Link, Google Scholar
• Corréa A. I., Langevin A., Rousseau L.-M., Régin J.-C., Rueher M. Dispatching and conflict-free routing of automated guided vehicles: A hybrid approach combining constraint programming and mixed integer programming. Proc. 1st Internat. Conf. Integration AI OR Techniques Constraint Programming Combinat. Optim. Problems (CPAIOR'04), Vol. 3011 (2004) (Springer, Berlin) 370–379Lecture Notes in Computer ScienceCrossref, Google Scholar
• Correia I., Captivo M. E. Bounds for the single-source modular capacitated plant location problem. Comput. Oper. Res. (2006) 33(10):2991–3003Crossref, Google Scholar
• Cortinhal M. J., Captivo M. E., Resende M. G. C., Pinho de Sousa J. Genetic algorithms for the single source capacitated location problem. Metaheuristics: Computer Decision-Making (2004) (Kluwer Academic Publishers, Norwell, MA) 187–216Google Scholar
• Current J., Daskin M., Schilling D., Drezner Z., Hamacher H. W. Discrete network location models. Facility Location: Applications and Theory (2002) (Springer, Berlin) 81–118Crossref, Google Scholar
• Delmaire H., Díaz J. A., Fernández E., Ortega M. Comparing new heuristics for the pure integer capacitated plant location problem. (1997) . Technical Report DR97/10, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, SpainGoogle Scholar
• Díaz J. A., Fernández E. A branch-and-price algorithm for the single source capacitated plant location problem. J. Oper. Res. Soc. (2002) 53(7):728–740Crossref, Google Scholar
• Drezner Z.Facility Location: A Survey of Applications and Methods (1995) (Springer-Verlag, New York) Springer Series in Operations ResearchCrossref, Google Scholar
• Fazel-Zarandi M. M., Beck J. C., Gent I. P. Solving a location-allocation problem with logic-based Benders' decomposition. Proc. 15th Internat. Conf. Principles Practice Constraint Programming (CP'2009), Vol. 5732 (2009) (Springer, Berlin) 344–351Lecture Notes in Computer ScienceCrossref, Google Scholar
• Galvão R. D., Raggi L. A. A method for solving to optimality uncapacitated location problems. Ann. Oper. Res. (1989) 18(1–4):225–244Crossref, Google Scholar
• Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20(5):822–844Link, Google Scholar
• Gronalt M., Hirsch P., Doerner K. F., Gendreau M., Greistorfer P., Gutiahr W., Hartl R. F., Reimann M. Log-truck scheduling with a tabu search strategy. Metaheuristics (2007) (Springer, New York) 65–88Crossref, Google Scholar
• Gronalt M., Hartl R., Reimann M. New savings-based algorithms for time-constrained pickup and delivery of full truckloads. Eur. J. Oper. Res. (2003) 151(3):520–535Crossref, Google Scholar
• Harjunkoski I., Grossmann I. E. A decomposition approach for the scheduling of a steel plant production. Comput. Chem. Engrg. (2001) 25(11–12):1647–1660Crossref, Google Scholar
• Hindi K. S., Piénkosz K. Efficient solution of large-scale, single-source, capacitated plant location problem. J. Oper. Res. Soc. (1999) 50(3):268–274Crossref, Google Scholar
• Holmberg K., Rönnqvist M., Yuan D. An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. (1999) 113(3):544–559Crossref, Google Scholar
• Hooker J.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley & Sons, New York) Crossref, Google Scholar
• Hooker J. N., Wallace M. A hybrid method for planning and scheduling. Proc. 10th Internat. Conf. Principles Practice Constraint Programming (CP'2004), Vol. 3258 (2004) (Springer, Berlin) 305–316Lecture Notes in Computer ScienceCrossref, Google Scholar
• Hooker J. N. A hybrid method for the planning and scheduling. Constraints (2005) 10(4):385–401Crossref, Google Scholar
• Hooker J. N. Planning and scheduling by logic-based Benders decomposition. Oper. Res. (2007) 55(3):588–602Link, Google Scholar
• Hooker J. N., Ottosson G. Logic-based Benders decomposition. Math. Programming (2003) 96(1):33–60Crossref, Google Scholar
• Jain V., Grossmann I. E. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. (2001) 13(4):258–276Link, Google Scholar
• Jaramillo J. H., Bhadury J., Batta R. On the use of genetic algorithms to solve location problems. Comput. Oper. Res. (2002) 29(6):761–779Crossref, Google Scholar
• Klose A. A branch and bound algorithm for an uncapacitated facility location problem with a side constraint. Internat. Trans. Oper. Res. (1998) 5(2):155–168Crossref, Google Scholar
• Labbé M., Rodríguez-Martín I., Salazar-Gonzalez J. J. A branch-and-cut algorithm for the plant-cycle location problem. J. Oper. Res. Soc. (2004) 55(5):513–520Crossref, Google Scholar
• Laporte G., Golden B. L., Assad A. A. Location-routing problems. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam) 163–197Google Scholar
• Laporte G., Louveaux F., Mercure H. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. (1989) 39(1):71–78Crossref, Google Scholar
• Laporte G., Nobert Y., Pelletier P. Hamiltonian location problems. Eur. J. Oper. Res. (1983) 12(1):82–89Crossref, Google Scholar
• Mina H., Jayaraman V., Srivastava R. Combined location-routing problems: A synthesis and future research directions. Eur. J. Oper. Res. (1998) 108(1):1–15Crossref, Google Scholar
• Nagy G., Salhi S. Nested heuristic methods for the location-routeing problem. J. Oper. Res. Soc. (1996) 47(9):1166–1174Crossref, Google Scholar
• Nagy G., Salhi S. Location-routing: Issues, models and methods. Eur. J. Oper. Res. (2007) 177(2):649–672Crossref, Google Scholar
• Owen S. H., Daskin M. S. Strategic facility location: A review. Eur. J. Oper. Res. (1998) 111(3):423–447Crossref, Google Scholar
• Özyurt Z., Aksen D., Baker E. K., Joseph A., Mehrotra A., Trick M. A. Solving the multi-depot location-routing problem with Lagrangian relaxation. Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies (2007) (Springer, New York) 125–144Crossref, Google Scholar
• Peterson B., Trick M. A., van Hoeve W.-J., Hooker J. N. A Benders' approach to a transportation network design problem. Proc. 16th Internat. Conf. Integration AI OR Techniques Constraint Programming Combinat. Optim. Problems (CPAIOR'09), Vol. 5547 (2009) (Springer, Berlin) 326–327Lecture Notes in Computer ScienceCrossref, Google Scholar
• Pisinger D., Sigurd M. Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J. Comput. (2009) 19(1):36–51Link, Google Scholar
• Richardson R. An optimization approach to routing aircraft. Transportation Sci. (1976) 10(1):52–71Link, Google Scholar
• Righini G. A double annealing algorithm for discrete location/allocation problems. Eur. J. Oper. Res. (1995) 86(3):452–468Crossref, Google Scholar
• Rosing K. E., ReVelle C. S., Rolland E., Schilling D. A., Current J. R. Heuristic concentration and tabu search: A head-to-head comparison. Eur. J. Oper. Res. (1998) 104(1):93–99Crossref, Google Scholar
• Salhi S., Rand G. K. The effect of ignoring routes when locating depots. Eur. J. Oper. Res. (1989) 39(2):150–156Crossref, Google Scholar
• Savelsbergh M. W. P., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29(1):17–29Link, Google Scholar
• Shaw P., Wallace M. A constraint for bin packing. Proc. 10th Internat. Conf. Principles Practice Constraint Programming (CP'2004), Vol. 3258 (2004) (Springer, Berlin) 648–662Lecture Notes in Computer ScienceCrossref, Google Scholar
• Sule D. R.Logistics of Facility Location and Allocation (2001) (CRC Press, Boca Raton, FL) Crossref, Google Scholar
• Sun M. Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. (2006) 33(9):2563–2589Crossref, Google Scholar
• Terekhov D., Beck J. C., Brown K. N. A constraint programming approach for solving a queueing design and control problem. INFORMS J. Comput. (2009) 21(4):549–561Link, Google Scholar
• Tuzun D., Burke L. I. A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. (1999) 116(1):87–99Crossref, Google Scholar
• Xia Q., Eremin A., Wallace M., Régin J.-C., Rueher M. Problem decomposition for traffic diversions. Proc. 1st Internat. Conf. Integration AI OR Techniques Constraint Programming Combinat. Optim. Problems (CPAIOR'04), Vol. 3011 (2004) (Springer, Berlin) 348–363Lecture Notes in Computer ScienceCrossref, Google Scholar
• Yu V. F., Lin S.-W., Lee W., Ting C.-J. A simulated annealing heuristic for the capacitated location routing problem. Comput. Oper. Res. (2010) 58(2):288–299Google Scholar