Global optimization algorithm for capacitated multi-facility continuous location-allocation problems

DOI10.1007/S10898-018-0621-6MaRDI QIDQ1668802zbMATH OpenOpenAlexFDO

Authors Cristiana L. Lara, Francisco Trespalacios, Ignacio E. Grossmann

Publication date 29 August 2018

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-018-0621-6

zbMATH Keywords

nonconvex optimizationmixed integer nonlinear programmingWeber problemgeneralized disjunctive programminglocation-allocation problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• New heuristic methods for the capacitated multi-facility Weber problem
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations

Cites work

• scientific article; zbMATH DE number 5501651 (Why is no real title available?)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
• A polyhedral branch-and-cut approach to global optimization
• A squared-euclidean distance location-allocation problem
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Benchmarking optimization software with performance profiles.
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• New heuristic methods for the capacitated multi-facility Weber problem
• The Transportation-Location Problem
• The fixed charge problem. I: A new heuristic method

Cited in

(12)

• Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests
• Decomposition strategies for large-scale continuous location–allocation problems
• Multicommodity flows and Benders decomposition for restricted continuous location problems
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• Planar multifacility location problems with tree structure and finite dominating sets
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
• A goal programming model for two-stage COVID19 test sampling centers location-allocation problem
• A model for the capacitated p-facility location problem in global environments

Describes a project that uses

Uses Software

• ANTIGONE
• CPLEX
• SCIP

This page was built for publication: Global optimization algorithm for capacitated multi-facility continuous location-allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668802)