Approximating the Pareto-front of Continuous Bi-objective Problems: Application to a Competitive Facility Location Problem
A new general multi-objective optimization heuristic algorithm, suitable for being applied to continuous multi-objective optimization problems is proposed. It deals with the problem at hand in a fast and efficient way. It combines ideas from different multi-objective and single-objective optimization evolutionary algorithms, although it also incorporates new devices which help to reduce the computational requirements, and also to improve the quality of the provided solutions. To show its applicability, a bi-objective competitive facility location and design problem is considered. This problem has been previously tackled through exact general methods, but they require high computational effort. A comprehensive computational study shows that the heuristic method is competitive, being able to reduce, in average, the computing time of the exact method by approximately 98%, and offering good quality in the final solutions.
KeywordsMultiobjective Optimization Demand Point Multiobjective Optimization Problem Competitive Location Competitive Facility Location
Unable to display preview. Download preview PDF.
- 6.Knowles, J.D., Corne, D.W.: The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation, vol. 1, pp. 98–105. IEEE Service Center (1999)Google Scholar
- 7.Knüppel, O.: PROFIL/BIAS - a fast interval library. Computing 1(53), 277–287 (1993)Google Scholar
- 12.Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K.C., Tsahalis, D.T., Périaux, J., Papailiou, K.D., Fogarty, T. (eds.) Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, Athens, Greece, pp. 95–100 (2001)Google Scholar