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

  title={Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example},
  author={Juan Guillermo Villegas and Fernando Palacios and Andr{\'e}s L. Medaglia},
  journal={Annals of Operations Research},
The Colombian coffee supply network, managed by the Federación Nacional de Cafeteros de Colombia (Colombian National Coffee-Growers Federation), requires slimming down operational costs while continuing to provide a high level of service in terms of coverage to its affiliated coffee growers. We model this problem as a biobjective (cost-coverage) uncapacitated facility location problem (BOUFLP). We designed and implemented three different algorithms for the BOUFLP that are able to obtain a good… 
The multi-objective uncapacitated facility location problem for green logistics
An exploratory study in which the environmental impact is modelled as a separate objective to the economic cost, and initial results are promising, indicating that this approach could indeed be used to provide informed choices to a human decision maker.
A New Genetic Approach for Supply Chain Optimization with Uncapacitated Facility
Traditionally, the uncapacitated facility location problem in supply chain management is solved as a single-objective optimization exercise, and focusses on minimizing the cost of operating a
A bi-objective multi-period facility location problem for household e-waste collection
Computational results show that the proposed metaheuristic based on local search is the most efficient for searching Pareto solutions of the problem.
Variations in the Flow Approach to CFCLP-TC for Multiobjective Supply Chain Design
We review the problem for the design of supply chains called Capacitated Fixed Cost Facility Location Problem with Transportation Choices (CFCLP-TC). The problem is based on a production network of
A Cultural Algorithm Applied in a Bi-Objective Uncapacitated Facility Location Problem
A Bi-Objective Cultural Algorithm (BOCA) is presented which was applied to the Bi- Objective Uncapacitated Facility Location Problem (BOUFLP) and it obtain an important improvement in comparison with other wellknow EMO algorithms such as PAES and NSGA-II.
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
This paper model and solve a bi-objective stochastic facility location problem, motivated by applications in disaster relief and public facility location, and embeds a Benders’ type decomposition approach into a recently developed branch-and-bound framework for bi-Objective integer optimization.
A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
A new multi-objective genetic algorithm (MOGA) called modified SPEA-II (mSPEA- II) is developed, which outperforms both NSGA-II and SPEA -II and is tested on randomly generated problems of different sizes.
A Lagrangian relaxation approach to fuzzy robust multi-objective facility location network design problem
This study considers a multi-objective combined budget constrained facility location/network design problem (FL/NDP) in which the system uncertainty is considered and an efficient robust optimization approach is applied to model the problem.
Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem
The location problem for a franchise type expanding firm in competition with other firms in a geographical area is dealt with and a heuristic algorithm is proposed which obtains a good approximation of the Pareto front when the new facilities have to be selected from a finite set of candidates.
Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm
This paper focuses on the facility location problem with two conflicting objectives. We observe that minimization of the total cost of a particular echelon may lead to the increase in the total cost


A multi‐objective logistics model for a capacitated service facility problem
There have been numerous extensions of the maximum covering location problem that has been developed in the last decade to deal with facility location. Most of the research, however, addresses a
Genetic algorithm approach on multi-criteria minimum spanning tree problem
Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem
It is argued that the best way to organise a hybrid LS for the mQAP will depend on details of the multiobjective fitness landscape, and a number of landscape measurement methods are contributed that are generally appropriate for multiobjectives combinatorial optimization.
A multicriteria approach to the location of public facilities
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms
  • M. Jensen
  • Computer Science
    IEEE Trans. Evol. Comput.
  • 2003
A new and efficient algorithm for nondominated sorting, which can speed up the processing time of some multiobjective evolutionary algorithms (MOEAs) substantially and points out that multi objective EAs using fitness based on dominance counting and identification of nondominated solutions can be improved significantly in terms of running time by using efficient algorithms known from computer science instead of inefficient O(MN/sup 2/) algorithms.
A new hybrid approach for solving the Uncapacitated Warehouse Location Problem (UWLP) by Simple Genetic Algorithm and AddHeuristic and the local search nature of Add-Heuristic provides achieving better regions of search for given problem.
Strategic facility location: A review
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously are investigated and suggested to be extended to higher dimensional and more difficult multiobjective problems.
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
It is argued that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set and provides strong evidence thatPAES performs consistently well on a range of multiobjective optimization tasks.