Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example

DOI10.1007/s10479-006-0061-4zbMath1183.90293OpenAlexW1965268960WikidataQ58760169 ScholiaQ58760169MaRDI QIDQ2379867

Juan G. Villegas, Andrés L. Medaglia, Fernando Palacios

Publication date: 23 March 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0061-4

zbMATH Keywords

integer programmingmulti-objective optimizationcombinatorial optimizationmulti-objective evolutionary algorithmsscenario analysisuncapacitated facility location

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (14)

Approximating the Pareto frontier for a challenging real-world bi-objective covering problem ⋮ A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem ⋮ A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems ⋮ Variations in the flow approach to CFCLP-TC for multiobjective supply chain design ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations ⋮ Parameter tuning for local-search-based matheuristic methods ⋮ A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ Multiple criteria facility location problems: a survey ⋮ PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION

Uses Software

• PAES
• Genocop
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multicriteria approach to the location of public facilities
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• A multi-objective model for locating fire stations
• Equity measurement in facility location analysis: A review and framework
• The quadratic assignment problem. Theory and algorithms
• Strategic facility location: A review
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• A genetic-based framework for solving (multi-criteria) weighted matching problems.
• Inventory, transportation, service quality and the location of distribution centers
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Multiobjective solution of the uncapacitated plant location problem
• Using genetic algorithms for single-machine bicriteria scheduling problems
• Solving the simple plant location problem by genetic algorithm
• An Overview of Representative Problems in Location Research
• Hospital Layout as a Quadratic Assignment Problem
• The Plant Location Problem: New Models and Research Prospects
• An Analysis of Private and Public Sector Location Models
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Multi-objective meta-heuristics: An overview of the current state-of-the-art
• On the use of genetic algorithms to solve location problems

This page was built for publication: Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example