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

Abstract

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 approximation of the Pareto frontier. We designed an algorithm based on the Nondominated Sorting Genetic Algorithm; an algorithm based on the Pareto Archive Evolution Strategy; and an algorithm based on mathematical programming. We developed a random problem generator for testing and comparison using as reference the Colombian coffee supply network with 29 depots and 47 purchasing centers. We compared the algorithms based on the quality of the approximation to the Pareto frontier using a nondominated space metric inspired on Zitzler and Thiele's. We used the mathematical programming-based algorithm to identify unique tradeoff opportunities for the reconfiguration of the Colombian coffee supply network. Finally, we illustrate an extension of the mathematical programming-based algorithm to perform scenario analysis for a set of uncapacitated location problems found in the literature.

A strategic model of port-hinterland freight distribution networks

“…The first part of the chromosome defines the open/close decisions for the locations and the second section defines the capacities assigned at each of the opened distribution centers. This representation scheme is similar to what has been used by Villegas et al (2006). Fig.…”

Parameter Tuning for Local-Search-Based Matheuristic Methods

“…, 1000 × 1000). For each problem class, 10 instances are randomly generated using the procedure proposed in [30] and that was also used in [5,23]. We do this in order to minimise any instance dependant effect.…”

A cost-effective decision-making algorithm for an RFID-enabled HMSC network design

“…The multi-objective mathematical model can be useful for solving the facility location-allocation problem of a supply chain design based on conflicting objectives (Gen and Cheng, 1997;Deb, 2001;Barros et al, 1998;Jayaraman et al, 1999;Krikke et al, 1999;Mohammed and Wang, 2017). These objectives may be involved in such as minimization of costs of investing and running a supply chain network, maximization of its incomes and customer satisfaction and minimization of the environmental impacts (Ding et al, 2006;Villegas et al, 2006;Bhattacharya and Bandyopadhyay, 2010;Cheshmehgaz et al, 2013;Hiremath et al, 2013). Nozick and Turnquist (2001) proposed a mathematical model used for optimization of locations of distribution centers based on costs of facility, inventory, transportation and service coverage.…”